Cover Image

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kanaya, Haruki, Eguchi, Ryota, Sasada, Taisho, Inoue, Michiko
Format:	Preprint
Published:	2024
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

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

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

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

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

Complementary Time-Space Tradeoff for Self-Stabilizing Leader Election: Polynomial States Meet Sublinear Time
by: Sudo, Yuichi
Published: (2025)

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

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

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

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)

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

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

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)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
by: El-Hayek, Antoine, 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)

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)

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

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

Broadcast in Almost Mixing Time
by: Paramonov, Anton, 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)

Byzantine-Resilient Population Protocols
by: Busch, Costas, et al.
Published: (2021)

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

Dynamic Size Counting in the Population Protocol Model
by: Kaaser, Dominik, et al.
Published: (2024)

Ranking Opinions with Few States in Population Protocols
by: Breitkopf, Tom-Lukas, et al.
Published: (2026)

Monotone Decontamination of Arbitrary Dynamic Graphs with Mobile Agents
by: Bar, Rajashree, et al.
Published: (2025)

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

Monadic Presburger Predicates have Robust Population Protocols
by: Czerner, Philipp, et al.
Published: (2026)

The Expressive Power of Uniform Population Protocols with Logarithmic Space
by: Czerner, Philipp, et al.
Published: (2024)

Distributed And Parallel Low-Diameter Decompositions for Arbitrary and Restricted Graphs
by: Dou, Jinfeng, et al.
Published: (2024)

Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols
by: Alpturer, Kaya, et al.
Published: (2025)

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

Breaking through the $Ω(n)$-space barrier: Population Protocols Decide Double-exponential Thresholds
by: Czerner, Philipp
Published: (2022)

Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol
by: Sony, Nasit S, et al.
Published: (2024)

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
by: Breitkopf, Tom-Lukas, et al.
Published: (2025)

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

Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
by: Bankhamer, Gregor, et al.
Published: (2024)

Near-Optimal Stability for Distributed Transaction Processing in Blockchain Sharding
by: Adhikari, Ramesh, et al.
Published: (2025)