Cover Image

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Fuchs, Marc, Ghinea, Diana, Parsaeian, Zahra, Rybicki, Joel
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

General Convex Agreement with Near-Optimal Communication
by: Dufay, Marc, et al.
Published: (2026)

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

Byzantine Stable Matching
by: Constantinescu, Andrei, et al.
Published: (2025)

Massively Parallel Ruling Set Made Deterministic
by: Giliberti, Jeff, et al.
Published: (2024)

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

Unifying Partial Synchrony
by: Constantinescu, Andrei, et al.
Published: (2024)

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

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

What can be computed in average anonymous networks?
by: Rybicki, Joel, et al.
Published: (2026)

Majority consensus thresholds in competitive Lotka--Volterra populations
by: Függer, Matthias, et al.
Published: (2024)

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time
by: Träff, Jesper Larsson
Published: (2023)

Space-efficient population protocols for exact majority on general graphs
by: Rybicki, Joel, et al.
Published: (2025)

Why Canonical Rounds Fail for Optimal Byzantine Resilience
by: Attiya, Hagit, et al.
Published: (2025)

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

Scaled Block Vecchia Approximation for High-Dimensional Gaussian Process Emulation on GPUs
by: Pan, Qilong, et al.
Published: (2025)

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

Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
by: Komatovic, Jovan, et al.
Published: (2024)

ConChain: A Scheme for Contention-free and Attack Resilient BlockChain
by: Bappy, Faisal Haque, et al.
Published: (2023)

Asynchronous Approximate Agreement with Quadratic Communication
by: Erbes, Mose Mizrahi, et al.
Published: (2024)

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

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

Amortized Asynchronous Byzantine Reliable Broadcast with Optimal Resilience
by: Hu, Michael Yiqing, et al.
Published: (2026)

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

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

Gathering in Non-Vertex-Transitive Graphs Under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

On the Universality of Round Elimination Fixed Points
by: Balliu, Alkida, et al.
Published: (2025)

Not eXactly Byzantine: Efficient and Resilient TEE-Based State Machine Replication
by: Leinweber, Marc, et al.
Published: (2025)

Delphi: Efficient Asynchronous Approximate Agreement for Distributed Oracles
by: Bandarupalli, Akhil, et al.
Published: (2024)

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

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

Near-optimal population protocols on bounded-degree trees
by: Rybicki, Joel, et al.
Published: (2026)

Reaching Agreement Among Reasoning LLM Agents
by: Ruan, Chaoyi, et al.
Published: (2025)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
by: Fuchs, Marc, et al.
Published: (2025)

Oblivious Robots Under Round Robin: Gathering on Rings
by: Navarra, Alfredo, et al.
Published: (2025)

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

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

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)

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

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

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