Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
DOI10.46298/DMTCS.9335MaRDI QIDQ6131780FDOQ6131780
Authors: Lélia Blin, Laurent Feuilloley 
Publication date: 18 April 2024
Published in: Discrete Mathematics & Theoretical Computer Science (Search for Journal in Brave)
leader electionself-stabilizationring topologyanonymousstate modelspace lower boundidentifiersmemory tight bound
Graph theory (including graph drawing) in computer science (68R10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Coloring of graphs and hypergraphs (05C15) Computer system organization (68Mxx)
This page was built for publication: Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6131780)
