Comparison of initial conditions for distributed algorithms on anonymous networks

DOI10.1145/301308.301352MaRDI QIDQ2942760zbMATH OpenOpenAlexFDO

Authors Naoshi Sakamoto

Publication date 11 September 2015

Published in Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/301308.301352

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)

Cited in

(12)

• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• The computational power of population protocols
• Leader election for anonymous asynchronous agents in arbitrary networks
• Map construction of unknown graphs by multiple agents
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Assigning labels in an unknown anonymous network with a leader
• Hundreds of impossibility results for distributed computing
• Topology recognition and leader election in colored networks
• Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks
• How much memory is needed for leader election
• Efficient computation in congested anonymous dynamic networks
• Efficient computation in congested anonymous dynamic networks

This page was built for publication: Comparison of initial conditions for distributed algorithms on anonymous networks

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