Anonymous wireless rings

DOI10.1016/0304-3975(94)00178-LzbMATH Open0874.68013OpenAlexW2029618506MaRDI QIDQ673090FDOQ673090

Authors: Krzysztof Diks, Evangelos Kranakis, Adam Malinowski, Andrzej Pelc 

Publication date: 28 February 1997

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(94)00178-l

Recommendations

• Better computing on the anonymous ring
• Computing on an anonymous ring
• Computational and symbolic anonymity in an unbounded network
• The distributed bit complexity of the ring: From the anonymous to the non-anonymous case
• scientific article; zbMATH DE number 17531

zbMATH Keywords

ring networks

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Electing a leader in a synchronous ring
• Computing on an anonymous ring
• An O ( n log n ) Unidirectional Algorithm for the Circular Extrema Problem
• Complexity of network synchronization
• An improved algorithm for decentralized extrema-finding in circular configurations of processes
• An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
• Language complexity on the synchronous anonymous ring
• The Bit Complexity of Randomized Leader Election on a Ring
• Bit-optimal election in synchronous rings
• Randomized function evaluation on a ring

Cited In (6)

• Weak models of distributed computing, with connections to modal logic
• Distributed tree comparison with nodes of limited memory
• How much memory is needed for leader election
• Topology recognition and leader election in colored networks
• Leader election for anonymous asynchronous agents in arbitrary networks
• Assigning labels in an unknown anonymous network with a leader

This page was built for publication: Anonymous wireless rings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q673090)