Imagen de Portada

A Space-Time Trade-off for Fast Self-Stabilizing Leader Election in Population Protocols

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Austin, Henry, Berenbrink, Petra, Friedetzky, Tom, Götte, Thorsten, Hintze, Lukas
Formato:	Preprint
Publicado:	2025
Materias:	Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Balls and Bins and the Infinite Process with Random Deletions
por: Berenbrink, Petra, et al.
Publicado: (2025)

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

(Almost) Perfect Discrete Iterative Load Balancing
por: Berenbrink, Petra, et al.
Publicado: (2025)

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

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

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

Undecided State Dynamics with Stubborn Agents
por: Berenbrink, Petra, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Byzantine-Resilient Population Protocols
por: Busch, Costas, et al.
Publicado: (2021)

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

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

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

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

Fast-HotStuff: A Fast and Resilient HotStuff Protocol
por: Jalalzai, Mohammad M., et al.
Publicado: (2020)

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

A Fast Confirmation Rule (aka Fast Synchronous Finality) for the Ethereum Consensus Protocol
por: Asgaonkar, Aditya, et al.
Publicado: (2024)

Hamster: A Fast Synchronous Byzantine Fault Tolerance Protocol
por: Fu, Ximing, et al.
Publicado: (2024)

A Study on Messaging Trade-offs in Data Streaming for Scientific Workflows
por: George, Anjus, et al.
Publicado: (2025)

Banyan: Fast Rotating Leader BFT
por: Vonlanthen, Yann, et al.
Publicado: (2023)

Snow: Self-organizing Broadcast Protocol for Cloud
por: Tong, Chengkai
Publicado: (2025)