Computing anonymously with arbitrary knowledge
From MaRDI portal
Publication:2942761
DOI10.1145/301308.301355zbMath1321.68064OpenAlexW1994101575MaRDI QIDQ2942761
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.301355
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14)
Related Items
Distributed tree comparison with nodes of limited memory, Almost universal anonymous rendezvous in the plane, Four shades of deterministic leader election in anonymous networks, How to meet when you forget: log-space rendezvous in arbitrary graphs, Relationships between broadcast and shared memory in reliable anonymous distributed systems, Activating anonymous ad hoc radio networks, 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, Knowledge, level of symmetry, and time of leader election, Leader election for anonymous asynchronous agents in arbitrary networks, Impact of knowledge on election time in anonymous networks, Efficient algorithms for anonymous Byzantine agreement, Topology recognition and leader election in colored networks, Weak models of distributed computing, with connections to modal logic, On the round complexity of Byzantine agreement without initial set-up, Topology recognition with advice, Anonymous meeting in networks
