Locally guided randomized elections in trees: The totally fair case

DOI10.1016/J.IC.2005.01.005zbMath1067.68175OpenAlexW2104584622MaRDI QIDQ1775889

Yves Métivier, Nasser Saheb-Djahromi, Akka Zemmari

Publication date: 4 May 2005

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2005.01.005

zbMATH Keywords

Probabilistic analysisStochastic processDistributed algorithmRandomized algorithmElection

Mathematics Subject Classification ID

Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

Models of random subtrees of a graph ⋮ Uniform election in trees and polyominoids

Cites Work

• Distributed Computing: A Locality-Sensitive Approach
• Introduction to Distributed Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Locally guided randomized elections in trees: The totally fair case