Saved in:
| Main Author: | Schmid, Gustav |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.02340 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks
by: Cruciani, Antonio
Published: (2025)
by: Cruciani, Antonio
Published: (2025)
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)
by: El-Hayek, Antoine, et al.
Published: (2025)
Distributed Algorithms for Potential Problems
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, et al.
Published: (2025)
Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)
by: Fraigniaud, Pierre, et al.
Published: (2025)
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
by: Balliu, Alkida, et al.
Published: (2026)
by: Balliu, Alkida, et al.
Published: (2026)
Topological Characterization of Consensus in Distributed Systems
by: Nowak, Thomas, et al.
Published: (2019)
by: Nowak, Thomas, et al.
Published: (2019)
A Logic for Repair and State Recovery in Byzantine Fault-tolerant Multi-agent Systems
by: van Ditmarsch, Hans, et al.
Published: (2024)
by: van Ditmarsch, Hans, et al.
Published: (2024)
Ranking Opinions with Few States in Population Protocols
by: Breitkopf, Tom-Lukas, et al.
Published: (2026)
by: Breitkopf, Tom-Lukas, et al.
Published: (2026)
A Learning-Augmented Overlay Network
by: Dallot, Julien, et al.
Published: (2025)
by: Dallot, Julien, et al.
Published: (2025)
Brief Announcement: Minimizing Energy Solves Relative Majority with a Cubic Number of States in Population Protocols
by: Breitkopf, Tom-Lukas, et al.
Published: (2025)
by: Breitkopf, Tom-Lukas, et al.
Published: (2025)
Software Resource Disaggregation for HPC with Serverless Computing
by: Copik, Marcin, et al.
Published: (2024)
by: Copik, Marcin, et al.
Published: (2024)
Dynamic Probabilistic Reliable Broadcast
by: Anikina, Veronika, et al.
Published: (2023)
by: Anikina, Veronika, et al.
Published: (2023)
A Study on Messaging Trade-offs in Data Streaming for Scientific Workflows
by: George, Anjus, et al.
Published: (2025)
by: George, Anjus, et al.
Published: (2025)
Multi-Path Bound for DAG Tasks
by: He, Qingqiang, et al.
Published: (2023)
by: He, Qingqiang, et al.
Published: (2023)
Towards Fully Automatic Distributed Lower Bounds
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Tight Lower Bounds in the Supported LOCAL Model
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Revisiting Lower Bounds for Two-Step Consensus
by: Ryabinin, Fedor, et al.
Published: (2025)
by: Ryabinin, Fedor, et al.
Published: (2025)
Beyond Optimal Fault Tolerance
by: Lewis-Pye, Andrew, et al.
Published: (2025)
by: Lewis-Pye, Andrew, et al.
Published: (2025)
The Carnot Bound: Limits and Possibilities for Bandwidth-Efficient Consensus
by: Lewis-Pye, Andrew, et al.
Published: (2026)
by: Lewis-Pye, Andrew, et al.
Published: (2026)
Gathering Teams of Bounded Memory Agents on a Line
by: Gao, Younan, et al.
Published: (2025)
by: Gao, Younan, et al.
Published: (2025)
Space-Time Trade-off in Bounded Iterated Memory
by: Toyos-Marfurt, Guillermo, et al.
Published: (2025)
by: Toyos-Marfurt, Guillermo, et al.
Published: (2025)
Bounding Distance Between Outputs in Distributed Lattice Agreement
by: Rasheed, Abdullah, et al.
Published: (2025)
by: Rasheed, Abdullah, et al.
Published: (2025)
AMP: Arc Multi-Proposer Protocol with Bounded Inclusion Guarantees
by: Cason, Daniel, et al.
Published: (2026)
by: Cason, Daniel, et al.
Published: (2026)
Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
by: Daas, Hussam Al, et al.
Published: (2026)
by: Daas, Hussam Al, et al.
Published: (2026)
Rise and Shine Efficiently! Tight Bounds for Adversarial Wake-up
by: Robinson, Peter, et al.
Published: (2024)
by: Robinson, Peter, et al.
Published: (2024)
Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
by: Daas, Hussam Al, et al.
Published: (2024)
by: Daas, Hussam Al, et al.
Published: (2024)
Partial Synchrony for Free? New Upper Bounds for Byzantine Agreement
by: Civit, Pierre, et al.
Published: (2024)
by: Civit, Pierre, et al.
Published: (2024)
PilotANN: Memory-Bounded GPU Acceleration for Vector Search
by: Gui, Yuntao, et al.
Published: (2025)
by: Gui, Yuntao, et al.
Published: (2025)
A Simple Lower Bound for Set Agreement in Dynamic Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)
by: Fraigniaud, Pierre, et al.
Published: (2025)
A Survey on Error-Bounded Lossy Compression for Scientific Datasets
by: Di, Sheng, et al.
Published: (2024)
by: Di, Sheng, et al.
Published: (2024)
Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
by: Parzych, Garrett, et al.
Published: (2024)
by: Parzych, Garrett, et al.
Published: (2024)
Lessons Learned on the Path to Guaranteeing the Error Bound in Lossy Quantizers
by: Fallin, Alex, et al.
Published: (2024)
by: Fallin, Alex, et al.
Published: (2024)
ABS: Adaptive Bounded Staleness Converges Faster and Communicates Less
by: Tan, Qiao, et al.
Published: (2023)
by: Tan, Qiao, et al.
Published: (2023)
A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
by: Brandt, Sebastian, et al.
Published: (2025)
by: Brandt, Sebastian, et al.
Published: (2025)
ZCCL: Significantly Improving Collective Communication With Error-Bounded Lossy Compression
by: Huang, Jiajun, et al.
Published: (2025)
by: Huang, Jiajun, et al.
Published: (2025)
Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
by: Naser-Pastoriza, Alejandro, et al.
Published: (2025)
by: Naser-Pastoriza, Alejandro, et al.
Published: (2025)
FedSZ: Leveraging Error-Bounded Lossy Compression for Federated Learning Communications
by: Wilkins, Grant, et al.
Published: (2023)
by: Wilkins, Grant, et al.
Published: (2023)
Uniform Partitioning of a Bounded Region using Opaque ASYNC Luminous Mobile Robots
by: Pramanick, Subhajit, et al.
Published: (2023)
by: Pramanick, Subhajit, et al.
Published: (2023)
The Evolution of Decentralized Systems: From Gray's Framework to Blockchain and Beyond
by: Dong, Zhongli, et al.
Published: (2026)
by: Dong, Zhongli, et al.
Published: (2026)
Similar Items
-
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
by: Balliu, Alkida, et al.
Published: (2024) -
Maintaining a Bounded Degree Expander in Dynamic Peer-to-Peer Networks
by: Cruciani, Antonio
Published: (2025) -
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) -
Distributed Algorithms for Potential Problems
by: Balliu, Alkida, et al.
Published: (2025) -
Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
by: Fraigniaud, Pierre, et al.
Published: (2025)