:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Rasheed, Abdullah, Dubagunta, Nidhi
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	https://arxiv.org/abs/2502.00247
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

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

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

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

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)

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

On the Decidability of Distributed Tasks with Output Sets under Asynchrony and Any Number of Crashes
by: Albouy, Timothé, et al.
Published: (2026)

Diagonal Scaling: A Multi-Dimensional Resource Model and Optimization Framework for Distributed Databases
by: Abdullah, Shahir, et al.
Published: (2025)

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

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

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

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

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

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

Distributed Agreement in the Arrovian Framework
by: Wood, Kenan, et al.
Published: (2024)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
by: Fuchs, Marc, et al.
Published: (2025)

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

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

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

Fully-Distributed Byzantine Agreement in Sparse Networks
by: Augustine, John, et al.
Published: (2024)

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

Tight Conditions for Binary-Output Tasks under Crashes
by: Albouy, Timothé, et al.
Published: (2025)

Rate-Distortion Bounds for Heterogeneous Random Fields on Finite Lattices
by: Sinha, Sujata, et al.
Published: (2026)

Fully Lattice-Linear Algorithms
by: Gupta, Arya Tanmay, et al.
Published: (2022)

Stochastic Distance in Property Testing
by: Meir, Uri, et al.
Published: (2024)

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

Coded Distributed Computing with Pre-set Assignments of Data and Output Functions
by: Wang, Yuhan, et al.
Published: (2022)

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)

Energy efficiency: a Lattice Boltzmann study
by: Turisini, Matteo, et al.
Published: (2024)

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

Time Optimal Distance-$k$-Dispersion on Dynamic Ring
by: Mondal, Brati, et al.
Published: (2024)

Efficient Accelerated Graph Edit Distance Computation on GPU
by: Dabah, Adel, et al.
Published: (2026)

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

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

Multi-Path Bound for DAG Tasks
by: He, Qingqiang, et al.
Published: (2023)

Juggernaut: Efficient Crypto-Agnostic Byzantine Agreement
by: Collins, Daniel, et al.
Published: (2024)

miniLB: A Performance Portability Study of Lattice-Boltzmann Simulations
by: Crisci, Luigi, et al.
Published: (2024)