Computing anonymously with arbitrary knowledge

DOI10.1145/301308.301355MaRDI QIDQ2942761zbMATH OpenOpenAlexFDO

Authors Paolo Boldi, Sebastiano Vigna

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

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cited in

(18)

• Topology recognition with advice
• Anonymous meeting in networks
• 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
• Impact of knowledge on election time in anonymous networks
• Almost universal anonymous rendezvous in the plane
• Topology recognition and leader election in colored networks
• Hundreds of impossibility results for distributed computing
• How to meet when you forget: log-space rendezvous in arbitrary graphs
• Activating anonymous ad hoc radio networks
• Four shades of deterministic leader election in anonymous networks
• The computational power of population protocols
• Leader election for anonymous asynchronous agents in arbitrary networks
• On the round complexity of Byzantine agreement without initial set-up
• Assigning labels in an unknown anonymous network with a leader
• Efficient algorithms for anonymous Byzantine agreement
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

This page was built for publication: Computing anonymously with arbitrary knowledge

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