Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications

DOI10.1007/978-3-319-03578-9_13zbMath1406.68127OpenAlexW2180708498MaRDI QIDQ2868641

John Michael Robson, Akka Zemmari, Yves Métivier

Publication date: 17 December 2013

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03578-9_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Monte Carlo methods (65C05) Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• How to select a loser
• Symmetry breaking in distributed networks
• Elections in anonymous networks
• Calling names on nameless networks
• On the distribution for the duration of a randomized leader election algorithm
• Randomized leader election
• The computational power of population protocols
• Asymptotic Properties of a Leader Election Algorithm
• Computing on an anonymous ring
• Introduction to Distributed Algorithms
• Distributed Computing

This page was built for publication: Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications