Comparison of initial conditions for distributed algorithms on anonymous networks
From MaRDI portal
Publication:2942760
DOI10.1145/301308.301352zbMath1321.68487OpenAlexW2083226930MaRDI QIDQ2942760
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
Network design and communication in computer systems (68M10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (11)
Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms ⋮ Brief Announcement: Efficient Computation in Congested Anonymous Dynamic Networks ⋮ Relationships between broadcast and shared memory in reliable anonymous distributed systems ⋮ The computational power of population protocols ⋮ Assigning labels in an unknown anonymous network with a leader ⋮ Hundreds of impossibility results for distributed computing ⋮ How much memory is needed for leader election ⋮ Map construction of unknown graphs by multiple agents ⋮ Knowledge, level of symmetry, and time of leader election ⋮ Leader election for anonymous asynchronous agents in arbitrary networks ⋮ Topology recognition and leader election in colored networks
This page was built for publication: Comparison of initial conditions for distributed algorithms on anonymous networks
