Imagen de Portada

Monadic Presburger Predicates have Robust Population Protocols

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Czerner, Philipp, Esparza, Javier, Fischer, Vincent, Guttenberg, Roland, Pins, Julian, Reilich, Simon
Formato:	Preprint
Publicado:	2026
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

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

The Black Ninjas and the Sniper: On Robustness of Population Protocols
por: Lossin, Benno, et al.
Publicado: (2024)

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

Verification of Population Protocols with Unordered Data
por: van Bergerem, Steffen, et al.
Publicado: (2024)

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

MonadBFT: Fast, Responsive, Fork-Resistant Streamlined Consensus
por: Jalalzai, Mohammad Mussadiq, et al.
Publicado: (2025)

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

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

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

Byzantine Fault Tolerant Protocols with Near-Constant Work per Node without Signatures
por: Schneider, Philipp
Publicado: (2025)

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

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

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

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
por: El-Hayek, Antoine, et al.
Publicado: (2025)

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

Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
por: Breitkopf, Tom-Lukas, 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)

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

Selective Population Protocols
por: Gańczorz, Adam, et al.
Publicado: (2023)

Reliable Replication Protocols on SmartNICs
por: Katebzadeh, M. R. Siavash, et al.
Publicado: (2025)

3-Slot-Finality Protocol for Ethereum
por: D'Amato, Francesco, et al.
Publicado: (2024)

Supervised Distributed Computing: Efficiency and Robustness under a Majority of Adversarial Workers
por: Augustine, John, et al.
Publicado: (2026)

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

Centroid Approximation with Multidimensional Approximate Agreement Protocols
por: Cambus, Melanie, et al.
Publicado: (2023)

On Quorum Sizes in DAG-Based BFT Protocols
por: Ladelsky, Razya, et al.
Publicado: (2025)

Slim-ABC: An Optimized Atomic Broadcast Protocol
por: Sony, Nasit S, et al.
Publicado: (2024)

A Knowledge-Based Analysis of Intersection Protocols
por: Alpturer, Kaya, et al.
Publicado: (2024)

SoK: DAG-based Consensus Protocols
por: Raikwar, Mayank, et al.
Publicado: (2024)

A Survey on Application Layer Protocols for IoT Networks
por: Hmissi, Fatma, et al.
Publicado: (2024)

Formal Modeling and Verification of the Algorand Consensus Protocol in CADP
por: Esposito, Andrea, et al.
Publicado: (2025)

Asynchrony-Resilient Sleepy Total-Order Broadcast Protocols
por: D'Amato, Francesco, et al.
Publicado: (2023)

Optimizing Communication in Byzantine Agreement Protocols with Slim-HBBFT
por: Sony, Nasit S, et al.
Publicado: (2025)

A Unified CPU-GPU Protocol for GNN Training
por: Lin, Yi-Chien, et al.
Publicado: (2024)

AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees
por: Cason, Daniel, et al.
Publicado: (2026)

Revisiting Speculative Leaderless Protocols for Low-Latency BFT Replication
por: Qian, Daniel, et al.
Publicado: (2026)

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

Towards Formal Verification of Federated Learning Orchestration Protocols on Satellites
por: Popovic, Miroslav, et al.
Publicado: (2024)

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

Pruning Blockchain Protocols for Efficient Access Control in IoT Systems
por: Huang, Yongtao, et al.
Publicado: (2024)

An Approach to Optimizing the VABA Protocol Using $κ$-size Committee
por: Sony, Nasit S
Publicado: (2024)