THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS

DOI10.1142/S0129054110007349zbMath1192.68844OpenAlexW2150039590MaRDI QIDQ3569285

Kunihiko Sadakane, Ei Ando, Hirotaka Ono, Masafumi Yamashita

Publication date: 18 June 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054110007349

zbMATH Keywords

distributed computingspace complexityanonymous networksleader election problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• Universal covers of graphs: Isomorphism to depth \(n-1\) implies isomorphism to all depths

This page was built for publication: THE SPACE COMPLEXITY OF LEADER ELECTION IN ANONYMOUS NETWORKS