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/

Zendy Plus

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

Zendy Tools

Zendy Open

This paper presents an efficient randomized emulation of single-hop radio network with collision detection on multi- hop radio network without collision detection. Each step of the single-hop network is emulated by O ((D+log ε n )logΔ) rounds of the multi-hop network and succeeds with probabil- ity ≥ 1 - ε. (n is the number of processors, D the diameter and Δ the maximum degree). It is shown how to emulate any polynomial algorithm such that the probability of failure remains ≤ ε. A consequence of the emulation is an efficient randomized algorithm for choosing a leader in a multi-hop network.

Efficient emulation of single-hop radio network with collision detection on multi-hop radio network with no collision detection