General Convex Agreement with Near-Optimal Communication
Fuente:
arXiv
Guardado en:
| Autores principales: | Dufay, Marc, Ghinea, Diana, Paramonov, Anton |
|---|---|
| Formato: | Preprint |
| Publicado: |
2026
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
por: Constantinescu, Andrei, et al.
Publicado: (2025)
por: Constantinescu, Andrei, et al.
Publicado: (2025)
Validity in Network-Agnostic Byzantine Agreement
por: Constantinescu, Andrei, et al.
Publicado: (2024)
por: Constantinescu, Andrei, et al.
Publicado: (2024)
Byzantine Stable Matching
por: Constantinescu, Andrei, et al.
Publicado: (2025)
por: Constantinescu, Andrei, et al.
Publicado: (2025)
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
por: Fuchs, Marc, et al.
Publicado: (2025)
por: Fuchs, Marc, et al.
Publicado: (2025)
Broadcast in Almost Mixing Time
por: Paramonov, Anton, et al.
Publicado: (2025)
por: Paramonov, Anton, et al.
Publicado: (2025)
Unifying Partial Synchrony
por: Constantinescu, Andrei, et al.
Publicado: (2024)
por: Constantinescu, Andrei, et al.
Publicado: (2024)
Mangrove: Fast and Parallelizable State Replication for Blockchains
por: Paramonov, Anton, et al.
Publicado: (2025)
por: Paramonov, Anton, et al.
Publicado: (2025)
Communication Efficient Byzantine Agreement with Predictions
por: Dzulfikar, Muhammad Ayaz, et al.
Publicado: (2026)
por: Dzulfikar, Muhammad Ayaz, et al.
Publicado: (2026)
Optimizing Communication in Byzantine Agreement Protocols with Slim-HBBFT
por: Sony, Nasit S, et al.
Publicado: (2025)
por: Sony, Nasit S, et al.
Publicado: (2025)
Near-Optimal Communication Byzantine Reliable Broadcast under a Message Adversary
por: Albouy, Timothé, et al.
Publicado: (2023)
por: Albouy, Timothé, et al.
Publicado: (2023)
Prioritized-MVBA: A New Approach to Design an Optimal Asynchronous Byzantine Agreement Protocol
por: Sony, Nasit S, et al.
Publicado: (2024)
por: Sony, Nasit S, et al.
Publicado: (2024)
Byzantine Agreement with Predictions
por: Ben-David, Naama, et al.
Publicado: (2025)
por: Ben-David, Naama, et al.
Publicado: (2025)
SHIRO: Near-Optimal Communication Strategies for Distributed Sparse Matrix Multiplication
por: Zhuang, Chen, et al.
Publicado: (2025)
por: Zhuang, Chen, et al.
Publicado: (2025)
Recursive Energy Efficient Agreement
por: Meir, Shachar, et al.
Publicado: (2026)
por: Meir, Shachar, et al.
Publicado: (2026)
Near-Optimal Stability for Distributed Transaction Processing in Blockchain Sharding
por: Adhikari, Ramesh, et al.
Publicado: (2025)
por: Adhikari, Ramesh, et al.
Publicado: (2025)
Efficient Signature-Free Validated Agreement
por: Civit, Pierre, et al.
Publicado: (2024)
por: Civit, Pierre, et al.
Publicado: (2024)
Reaching Agreement in Competitive Microbial Systems
por: Andaur, Victoria, et al.
Publicado: (2021)
por: Andaur, Victoria, et al.
Publicado: (2021)
Asynchronous Approximate Agreement with Quadratic Communication
por: Erbes, Mose Mizrahi, et al.
Publicado: (2024)
por: Erbes, Mose Mizrahi, et al.
Publicado: (2024)
Centroid Approximation with Multidimensional Approximate Agreement Protocols
por: Cambus, Melanie, et al.
Publicado: (2023)
por: Cambus, Melanie, et al.
Publicado: (2023)
Reaching Agreement Among Reasoning LLM Agents
por: Ruan, Chaoyi, et al.
Publicado: (2025)
por: Ruan, Chaoyi, et al.
Publicado: (2025)
LCI: a Lightweight Communication Interface for Efficient Asynchronous Multithreaded Communication
por: Yan, Jiakun, et al.
Publicado: (2025)
por: Yan, Jiakun, et al.
Publicado: (2025)
Memory Bounds for Concurrent Bounded Queues
por: Aksenov, Vitaly, et al.
Publicado: (2021)
por: Aksenov, Vitaly, et al.
Publicado: (2021)
Bounding Distance Between Outputs in Distributed Lattice Agreement
por: Rasheed, Abdullah, et al.
Publicado: (2025)
por: Rasheed, Abdullah, et al.
Publicado: (2025)
Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
por: Fraigniaud, Pierre, et al.
Publicado: (2025)
por: Fraigniaud, Pierre, et al.
Publicado: (2025)
Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
por: Civit, Pierre, et al.
Publicado: (2024)
por: Civit, Pierre, et al.
Publicado: (2024)
A Simple Lower Bound for Set Agreement in Dynamic Networks
por: Fraigniaud, Pierre, et al.
Publicado: (2025)
por: Fraigniaud, Pierre, et al.
Publicado: (2025)
Agreement Tasks in Fault-Prone Synchronous Networks of Arbitrary Structure
por: Fraigniaud, Pierre, et al.
Publicado: (2024)
por: Fraigniaud, Pierre, et al.
Publicado: (2024)
Reconfigurable Holographic Surfaces and Near Field Communication for Non-Terrestrial Networks: Potential and Challenges
por: Jamshed, Muhammad Ali, et al.
Publicado: (2025)
por: Jamshed, Muhammad Ali, et al.
Publicado: (2025)
Contemplating a Lightweight Communication Interface for Asynchronous Many-Task Systems
por: Yan, Jiakun, et al.
Publicado: (2025)
por: Yan, Jiakun, et al.
Publicado: (2025)
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
por: Daas, Hussam Al, et al.
Publicado: (2024)
por: Daas, Hussam Al, et al.
Publicado: (2024)
A Near-Optimal Low-Energy Deterministic Distributed SSSP with Ramifications on Congestion and APSP
por: Ghaffari, Mohsen, et al.
Publicado: (2024)
por: Ghaffari, Mohsen, et al.
Publicado: (2024)
Examining MPI and its Extensions for Asynchronous Multithreaded Communication
por: Yan, Jiakun, et al.
Publicado: (2025)
por: Yan, Jiakun, et al.
Publicado: (2025)
Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
por: Gańczorz, Adam, et al.
Publicado: (2024)
por: Gańczorz, Adam, et al.
Publicado: (2024)
Logarithmic-Time Geodesically Convex Decomposition in Programmable Matter
por: Hillebrandt, Henning, et al.
Publicado: (2026)
por: Hillebrandt, Henning, et al.
Publicado: (2026)
Understanding the Communication Needs of Asynchronous Many-Task Systems -- A Case Study of HPX+LCI
por: Yan, Jiakun, et al.
Publicado: (2025)
por: Yan, Jiakun, et al.
Publicado: (2025)
A Committee Based Optimal Asynchronous Byzantine Agreement Protocol W.P. 1
por: Sony, Nasit S, et al.
Publicado: (2024)
por: Sony, Nasit S, et al.
Publicado: (2024)
FedADAS: Communication-Efficient Federated Distillation for On-Device Driver Yawn Recognition in Vehicular Networks
por: Mujtaba, Ahmed, et al.
Publicado: (2026)
por: Mujtaba, Ahmed, et al.
Publicado: (2026)
Optimizing Streamlined Blockchain Consensus with Generalized Weighted Voting and Enhanced Leader Rotation
por: Micloiu, Diana, et al.
Publicado: (2024)
por: Micloiu, Diana, et al.
Publicado: (2024)
Kino-PAX$^+$: Near-Optimal Massively Parallel Kinodynamic Sampling-based Motion Planner
por: Perrault, Nicolas, et al.
Publicado: (2026)
por: Perrault, Nicolas, et al.
Publicado: (2026)
Differentially Private Perturbed Push-Sum Protocol and Its Application in Non-Convex Optimization
por: Zhou, Yiming, et al.
Publicado: (2026)
por: Zhou, Yiming, et al.
Publicado: (2026)
Ejemplares similares
-
From Few to Many Faults: Optimal Adaptive Byzantine Agreement
por: Constantinescu, Andrei, et al.
Publicado: (2025) -
Validity in Network-Agnostic Byzantine Agreement
por: Constantinescu, Andrei, et al.
Publicado: (2024) -
Byzantine Stable Matching
por: Constantinescu, Andrei, et al.
Publicado: (2025) -
Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
por: Fuchs, Marc, et al.
Publicado: (2025) -
Broadcast in Almost Mixing Time
por: Paramonov, Anton, et al.
Publicado: (2025)