Cover Image

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fraigniaud, Pierre, Nguyen, Minh Hang, Paz, Ami, Schmid, Ulrich, Galeana, Hugo Rincon
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

Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
by: Fraigniaud, Pierre, et al.
Published: (2024)

A Simple Lower Bound for Set Agreement in Dynamic Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

The Topology of Local Computing in Networks
by: Fraigniaud, Pierre, et al.
Published: (2020)

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
by: Balliu, Alkida, et al.
Published: (2024)

Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems
by: Galeana, Hugo Rincon, et al.
Published: (2023)

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
by: Balliu, Alkida, et al.
Published: (2024)

Distributed Coloring in the SLEEPING Model
by: Dufoulon, Fabien, et al.
Published: (2024)

$k$-Center Clustering in Distributed Models
by: Biabani, Leyla, 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)

Revisiting Lower Bounds for Two-Step Consensus
by: Ryabinin, Fedor, et al.
Published: (2025)

Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
by: Civit, Pierre, et al.
Published: (2024)

A Logic for Repair and State Recovery in Byzantine Fault-tolerant Multi-agent Systems
by: van Ditmarsch, Hans, et al.
Published: (2024)

LCLs Beyond Bounded Degrees
by: Schmid, Gustav
Published: (2026)

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

From Few to Many Faults: Optimal Adaptive Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2025)

A Sufficient Epistemic Condition for Solving Stabilizing Agreement
by: Cignarale, Giorgio, et al.
Published: (2024)

Topological Characterization of Stabilizing Consensus
by: Schmid, Ulrich, et al.
Published: (2024)

Bounding Distance Between Outputs in Distributed Lattice Agreement
by: Rasheed, Abdullah, et al.
Published: (2025)

Even-Cycle Detection in the Randomized and Quantum CONGEST Model
by: Fraigniaud, Pierre, et al.
Published: (2024)

Portability Efficiency Approach for Calculating Performance Portability
by: Marowka, Ami
Published: (2024)

Validity in Network-Agnostic Byzantine Agreement
by: Constantinescu, Andrei, et al.
Published: (2024)

Efficient Signature-Free Validated Agreement
by: Civit, Pierre, et al.
Published: (2024)

Towards Fully Automatic Distributed Lower Bounds
by: Balliu, Alkida, et al.
Published: (2024)

Tight Lower Bounds in the Supported LOCAL Model
by: Balliu, Alkida, et al.
Published: (2024)

Topological Characterization of Consensus in Distributed Systems
by: Nowak, Thomas, et al.
Published: (2019)

Deterministic Even-Cycle Detection in Broadcast CONGEST
by: Fraigniaud, Pierre, et al.
Published: (2024)

Resilient Byzantine Agreement with Predictions
by: Dallot, Julien, et al.
Published: (2026)

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
by: Daas, Hussam Al, et al.
Published: (2024)

Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
by: Daas, Hussam Al, et al.
Published: (2026)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
by: Parzych, Garrett, et al.
Published: (2024)

Approximate Agreement Algorithms for Byzantine Collaborative Learning
by: Cambus, Mélanie, et al.
Published: (2025)

A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
by: Brandt, Sebastian, et al.
Published: (2025)

Byzantine Agreement with Predictions
by: Ben-David, Naama, et al.
Published: (2025)

Quantum-Enhanced Distributed Sensor Fusion: Lower Bounds on Aggregation from Projection Noise to Heisenberg-Limited Byzantine-Tolerant Networks
by: Iyer, Vasanth, et al.
Published: (2026)

Recursive Energy Efficient Agreement
by: Meir, Shachar, et al.
Published: (2026)

Fault-tolerant Consensus in Anonymous Dynamic Network
by: Zhang, Qinzi, et al.
Published: (2024)

Distributed Non-Interactive Zero-Knowledge Proofs
by: Grilo, Alex B., et al.
Published: (2025)

Self-Correcting Gossip Protocols
by: Cignarale, Giorgio, et al.
Published: (2026)

Communication Efficient Byzantine Agreement with Predictions
by: Dzulfikar, Muhammad Ayaz, et al.
Published: (2026)

Reaching Agreement in Competitive Microbial Systems
by: Andaur, Victoria, et al.
Published: (2021)