Image de couverture de livre

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	El-Hayek, Antoine, Elsässer, Robert, Schmid, Stefan
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Ranking Opinions with Few States in Population Protocols
par: Breitkopf, Tom-Lukas, et autres
Publié: (2026)

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
par: Breitkopf, Tom-Lukas, et autres
Publié: (2025)

Population Protocols for Exact Plurality Consensus -- How a small chance of failure helps to eliminate insignificant opinions
par: Bankhamer, Gregor, et autres
Publié: (2024)

Time Complexity of Broadcast and Consensus for Randomized Oblivious Message Adversaries
par: El-Hayek, Antoine, et autres
Publié: (2023)

Tight Lower Bounds in the Supported LOCAL Model
par: Balliu, Alkida, et autres
Publié: (2024)

Undecided State Dynamics with Many Opinions
par: Cooper, Colin, et autres
Publié: (2026)

Undecided State Dynamics with Stubborn Agents
par: Berenbrink, Petra, et autres
Publié: (2024)

Revisiting Lower Bounds for Two-Step Consensus
par: Ryabinin, Fedor, et autres
Publié: (2025)

Local Fast Rerouting with Low Congestion: A Randomized Approach
par: Bankhamer, Gregor, et autres
Publié: (2020)

Dynamic Size Counting in the Population Protocol Model
par: Kaaser, Dominik, et autres
Publié: (2024)

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
par: Fraigniaud, Pierre, et autres
Publié: (2025)

(Almost) Perfect Discrete Iterative Load Balancing
par: Berenbrink, Petra, et autres
Publié: (2025)

Almost Time-Optimal Loosely-Stabilizing Leader Election on Arbitrary Graphs Without Identifiers in Population Protocols
par: Kanaya, Haruki, et autres
Publié: (2024)

LCLs Beyond Bounded Degrees
par: Schmid, Gustav
Publié: (2026)

Formal Modeling and Verification of the Algorand Consensus Protocol in CADP
par: Esposito, Andrea, et autres
Publié: (2025)

Topological Characterization of Consensus in Distributed Systems
par: Nowak, Thomas, et autres
Publié: (2019)

Model Checking and Synthesis for Optimal Use of Knowledge in Consensus Protocols
par: Alpturer, Kaya, et autres
Publié: (2025)

A Simple Lower Bound for Set Agreement in Dynamic Networks
par: Fraigniaud, Pierre, et autres
Publié: (2025)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
par: Parzych, Garrett, et autres
Publié: (2024)

SoK: DAG-based Consensus Protocols
par: Raikwar, Mayank, et autres
Publié: (2024)

DynaShard: Secure and Adaptive Blockchain Sharding Protocol with Hybrid Consensus and Dynamic Shard Management
par: Liu, Ao, et autres
Publié: (2024)

Rise and Shine Efficiently! Tight Bounds for Adversarial Wake-up
par: Robinson, Peter, et autres
Publié: (2024)

Sublinear-time Collision Detection with a Polynomial Number of States in Population Protocols
par: Araya, Takumi, et autres
Publié: (2024)

Byzantine-Resilient Population Protocols
par: Busch, Costas, et autres
Publié: (2021)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Interactive Visualization of Proof-of-Work Consensus Protocol on Raspberry Pi
par: Ivashkevich, Anton, et autres
Publié: (2025)

DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus
par: d'Amore, Francesco, et autres
Publié: (2026)

Falcon: Advancing Asynchronous BFT Consensus for Lower Latency and Enhanced Throughput
par: Dai, Xiaohai, et autres
Publié: (2025)

The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
par: Lewis-Pye, Andrew, et autres
Publié: (2026)

Complete Graph Identification in Population Protocols
par: Kanaya, Haruki, et autres
Publié: (2024)

Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
par: Naser-Pastoriza, Alejandro, et autres
Publié: (2025)

Towards Fully Automatic Distributed Lower Bounds
par: Balliu, Alkida, et autres
Publié: (2024)

FFTrainer: Fast Failover in Large-Language Model Training with Almost-Free State Management
par: Zhao, Bohan, et autres
Publié: (2025)

Dynamic Probabilistic Reliable Broadcast
par: Anikina, Veronika, et autres
Publié: (2023)

A Fast Confirmation Rule (aka Fast Synchronous Finality) for the Ethereum Consensus Protocol
par: Asgaonkar, Aditya, et autres
Publié: (2024)

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
par: Sudo, Yuichi, et autres
Publié: (2026)

Monadic Presburger Predicates have Robust Population Protocols
par: Czerner, Philipp, et autres
Publié: (2026)

The Expressive Power of Uniform Population Protocols with Logarithmic Space
par: Czerner, Philipp, et autres
Publié: (2024)

Asymptotic Subspace Consensus in Dynamic Networks
par: Függer, Matthias, et autres
Publié: (2026)

Silent Self-Stabilizing Ranking: Time Optimal and Space Efficient
par: Berenbrink, Petra, et autres
Publié: (2025)