English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We present fast deterministic distributed protocols in synchronous networksfor leader election and spanning tree construction. The protocols are designedunder the assumption that nodes in a network have identifiers but the size ofan identifier is unlimited. So time bounds of protocols depend on the sizes ofidentifiers. We present fast protocols running in time $O(D\log L+L)$, where$L$ is the size of the minimal identifier and $D$ is the diameter of a network.

Distributed protocols for spanning tree construction and leader election