Self-stabilizing leader election in optimal space under an arbitrary scheduler
From MaRDI portal
Publication:719296
DOI10.1016/j.tcs.2010.05.001zbMath1222.68043OpenAlexW2041740671MaRDI QIDQ719296
Lawrence L. Larmore, Priyanka Vemula, Ajoy K. Datta
Publication date: 10 October 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.05.001
Related Items
A silent self-stabilizing algorithm for the generalized minimal \(k\)-dominating set problem ⋮ A self-stabilizing algorithm for the median problem in partial rectangular grids and their relatives ⋮ An \(O(n)\)-time self-stabilizing leader election algorithm ⋮ A Self-Stabilizing Algorithm for a Maximal 2-Packing in a Cactus Graph Under Any Scheduler ⋮ Fast and compact self-stabilizing verification, computation, and fault detection of an MST ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative ⋮ Self-stabilizing silent disjunction in an anonymous network ⋮ Self-stabilizing leader election in polynomial steps ⋮ The first fully polynomial stabilizing algorithm for BFS tree construction ⋮ Self-stabilizing leader election in dynamic networks ⋮ Verifying Recurrence Properties in Self-stabilization by Checking the Absence of Finite Counterexamples ⋮ Optimized silent self-stabilizing scheme for tree-based constructions ⋮ Near-optimal knowledge-free resilient leader election
Cites Work
