Cover Image

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Sudo, Yuichi
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
by: Araya, Takumi, et al.
Published: (2024)

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols
by: Austin, Henry, et al.
Published: (2025)

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
by: Kanaya, Haruki, et al.
Published: (2024)

Self-stabilizing Graph Exploration by a Single Agent
by: Sudo, Yuichi, et al.
Published: (2020)

Complete Graph Identification in Population Protocols
by: Kanaya, Haruki, et al.
Published: (2024)

Self-Stabilizing Weakly Byzantine Perpetual Gathering of Mobile Agents
by: Hirose, Jion, et al.
Published: (2025)

Silent Self-Stabilising Leader Election in Programmable Matter Systems with Holes
by: Chalopin, Jérémie, et al.
Published: (2025)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
by: Chalopin, Jérémie, et al.
Published: (2024)

Leader Election via Unique Sink Orientation
by: Chalopin, Jérémie, et al.
Published: (2025)

Minimalist Leader Election Under Weak Communication
by: Vacus, Robin, et al.
Published: (2025)

PALE: Partially Asynchronous Agile Leader Election
by: Sidik, Bronislav, et al.
Published: (2018)

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient
by: Berenbrink, Petra, et al.
Published: (2025)

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
by: Sudo, Yuichi, et al.
Published: (2026)

Near-linear Time Dispersion of Mobile Agents
by: Sudo, Yuichi, et al.
Published: (2023)

Content-Oblivious Leader Election in 2-Edge-Connected Networks
by: Chalopin, Jérémie, et al.
Published: (2025)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
by: Chalopin, Jérémie, et al.
Published: (2024)

Time- and Space-Optimal Silent Self-Stabilizing Exact Majority in Population Protocols
by: Kanaya, Haruki, et al.
Published: (2025)

Non-Uniform Content-Oblivious Leader Election on Oriented Asynchronous Rings
by: Chalopin, Jérémie, et al.
Published: (2025)

Beyond 2-Edge-Connectivity: Algorithms and Impossibility for Content-Oblivious Leader Election
by: Chang, Yi-Jun, et al.
Published: (2025)

Improving Efficiency in Near-State and State-Optimal Self-Stabilising Leader Election Population Protocols
by: Gąsieniec, Leszek, et al.
Published: (2025)

Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors
by: Takahashi, Shota, et al.
Published: (2025)

Efficient D-2-D via Leader Election: Arbitrary Initial Configuration and No Global Knowledge
by: Kaur, Tanvir, et al.
Published: (2024)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
by: Sadhukhan, Abhijit, et al.
Published: (2026)

Polynomial Time Local Decision Revisited
by: Feuilloley, Laurent, et al.
Published: (2026)

Asymptotic Analysis of a Leader Election Algorithm
by: Lavault, Christian, et al.
Published: (2006)

Reputation-Based Leader Election under Partial Synchrony: Towards a Protocol-Independent Abstraction with Enhanced Guarantees
by: Liu, Xuyang, et al.
Published: (2025)

Informative Trains: A Memory-Efficient Journey to a Self-Stabilizing Leader Election Algorithm in Anonymous Graphs
by: Blin, Lelia, et al.
Published: (2026)

Content-Oblivious Leader Election on Rings
by: Frei, Fabian, et al.
Published: (2024)

Deterministic Self-Stabilizing BFS Construction in Constant Space
by: Blin, Lélia, et al.
Published: (2025)

Sublinear-Time Sampling of Spanning Trees in the Congested Clique
by: Pemmaraju, Sriram V., et al.
Published: (2024)

Simulations between Strongly Sublinear MPC and Node-Capacitated Clique
by: Schneider, Philipp, et al.
Published: (2025)

Universal Finite-State and Self-Stabilizing Computation in Anonymous Dynamic Networks
by: Di Luna, Giuseppe A., et al.
Published: (2024)

Space-Time Trade-off in Bounded Iterated Memory
by: Toyos-Marfurt, Guillermo, et al.
Published: (2025)

Exploration of Energy and Throughput Tradeoffs for Dataflow Networks
by: Karim, Abrarul, et al.
Published: (2026)

Distributed Renaming with Subquadratic Bits via Scalable Committee Election
by: Bai, Sirui, et al.
Published: (2026)

Eliminating Timing Anomalies in Scheduling Periodic Segmented Self-Suspending Tasks with Release Jitter
by: Lin, Ching-Chi, et al.
Published: (2024)

Self-Stabilizing MIS Computation in the Beeping Model
by: Giakkoupis, George, et al.
Published: (2024)

Dynatune: Dynamic Tuning of Raft Election Parameters Using Network Measurement
by: Shiozaki, Kohya, et al.
Published: (2025)

Leveraging Structural Knowledge for Solving Election in Anonymous Networks with Shared Randomness
by: Chalopin, Jérémie, et al.
Published: (2026)

Quantum Communication Advantage for Leader Election and Agreement
by: Dufoulon, Fabien, et al.
Published: (2025)