Communication efficient self-stabilizing leader election
From MaRDI portal
Publication:6535008
DOI10.4230/lipics.disc.2020.11zbMath1543.68036MaRDI QIDQ6535008
Toshimitsu Masuzawa, Yasumasa Tamura, Shay Kutten, Xavier Défago, Yuval Emek
Publication date: 2 November 2023
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Distributed systems (68M14) Randomized algorithms (68W20) Distributed algorithms (68W15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Self-stabilization of dynamic systems assuming only read/write atomicity
- Self-stabilizing extensions for message-passing systems
- Self-stabilization over unreliable communication media
- Self-stabilizing depth-first token circulation on networks
- Self-stabilizing depth-first search
- The local detection paradigm and its applications to self-stabilization
- Memory requirements for silent stabilization
- The first fully polynomial stabilizing algorithm for BFS tree construction
- Compact self-stabilizing leader election for general networks
- The first polynomial self-stabilizing 1-maximal matching algorithm for general graphs
- Construction and Impromptu Repair of an MST in a Distributed Network with o(m) Communication
- Memory space requirements for self-stabilizing leader election protocols
- Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks
- A trade-off between information and communication in broadcast protocols
- Time Optimal Asynchronous Self-stabilizing Spanning Tree
- Low Communication Self-stabilization through Randomization
- A New Self-stabilizing Minimum Spanning Tree Construction with Loop-Free Property
- Electing a leader in a synchronous ring
- An O(n log n) unidirectional distributed algorithm for extrema finding in a circle
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
- Proof-Labeling Schemes: Broadcast, Unicast and in Between
- The part-time parliament
- A Simple Deterministic Distributed MST Algorithm with Near-Optimal Time and Message Complexities
- Self-stabilizing depth-first token circulation in arbitrary rooted networks
- Time optimal self-stabilizing synchronization
- Resource bounds for self stabilizing message driven protocols
- Introduction to Distributed Self-Stabilizing Algorithms
- Reducing the number of messages in self-stabilizing protocols
Related Items (1)
This page was built for publication: Communication efficient self-stabilizing leader election
