Elections in anonymous networks
From MaRDI portal
Publication:1333265
DOI10.1006/inco.1994.1075zbMath0942.68791OpenAlexW1966215457MaRDI QIDQ1333265
Publication date: 2 August 2000
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/8565c8571ff1d5c2dee5b19b01c890e142714843
Network design and communication in computer systems (68M10) Parallel algorithms in computer science (68W10)
Related Items (6)
The local detection paradigm and its applications to self-stabilization ⋮ Improved Tradeoffs for Leader Election ⋮ Deterministic leader election takes \(\Theta (D + \log n)\) bit rounds ⋮ Unnamed Item ⋮ Analysis of fully distributed splitting and naming probabilistic procedures and applications ⋮ Analysis of Fully Distributed Splitting and Naming Probabilistic Procedures and Applications
This page was built for publication: Elections in anonymous networks
