Distributed Algorithms for Potential Problems
Fuente:
arXiv
Saved in:
| Main Authors: | Balliu, Alkida, Boudier, Thomas, d'Amore, Francesco, Kuhn, Fabian, Olivetti, Dennis, Schmid, Gustav, Suomela, Jukka |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Distributed Quantum Advantage in Locally Checkable Labeling Problems
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, et al.
Published: (2025)
New Hardness Results for the LOCAL Model via a Simple Self-Reduction
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, et al.
Published: (2025)
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, et al.
Published: (2025)
Shared Randomness Helps with Local Distributed Problems
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)
Distributed Computation with Local Advice
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
On the Universality of Round Elimination Fixed Points
by: Balliu, Alkida, et al.
Published: (2025)
by: Balliu, Alkida, 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)
Towards Fully Automatic Distributed Lower Bounds
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
by: Balliu, Alkida, et al.
Published: (2023)
by: Balliu, Alkida, et al.
Published: (2023)
Distributed Quantum Advantage for Local Problems
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
On the Limits of Distributed Quantum Computing
by: d'Amore, Francesco
Published: (2025)
by: d'Amore, Francesco
Published: (2025)
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
by: Balliu, Alkida, et al.
Published: (2024)
by: Balliu, Alkida, et al.
Published: (2024)
Classification of Local Optimization Problems in Directed Cycles
by: Boudier, Thomas, et al.
Published: (2026)
by: Boudier, Thomas, et al.
Published: (2026)
Phase transition of the 3-majority opinion dynamics with noisy interactions
by: d'Amore, Francesco, et al.
Published: (2021)
by: d'Amore, Francesco, et al.
Published: (2021)
No distributed quantum advantage for approximate graph coloring
by: Coiteux-Roy, Xavier, et al.
Published: (2023)
by: Coiteux-Roy, Xavier, et al.
Published: (2023)
DejaVu: A Minimalistic Mechanism for Distributed Plurality Consensus
by: d'Amore, Francesco, et al.
Published: (2026)
by: d'Amore, Francesco, et al.
Published: (2026)
On the $h$-majority dynamics with many opinions
by: d'Amore, Francesco, et al.
Published: (2025)
by: d'Amore, Francesco, et al.
Published: (2025)
Search via Parallel Lévy Walks on $\mathbb{Z}^2$
by: Clementi, Andrea, et al.
Published: (2020)
by: Clementi, Andrea, et al.
Published: (2020)
Phase Transition of a Non-Linear Opinion Dynamics with Noisy Interactions
by: d'Amore, Francesco, et al.
Published: (2020)
by: d'Amore, Francesco, et al.
Published: (2020)
Online Locality Meets Distributed Quantum Computing
by: Akbari, Amirreza, et al.
Published: (2024)
by: Akbari, Amirreza, et al.
Published: (2024)
LCLs Beyond Bounded Degrees
by: Schmid, Gustav
Published: (2026)
by: Schmid, Gustav
Published: (2026)
It does not matter how you define locally checkable labelings
by: Cruciani, Antonio, et al.
Published: (2026)
by: Cruciani, Antonio, et al.
Published: (2026)
Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)
by: Bonamy, Marthe, et al.
Published: (2026)
Local problems in trees across a wide range of distributed models
by: Dhar, Anubhav, et al.
Published: (2024)
by: Dhar, Anubhav, et al.
Published: (2024)
Topological Characterization of Consensus in Distributed Systems
by: Nowak, Thomas, et al.
Published: (2019)
by: Nowak, Thomas, et al.
Published: (2019)
Is a LOCAL algorithm computable?
by: Cruciani, Antonio, et al.
Published: (2026)
by: Cruciani, Antonio, et al.
Published: (2026)
2-Coloring Cycles in One Round
by: Flin, Maxime, et al.
Published: (2026)
by: Flin, Maxime, et al.
Published: (2026)
Low-Bandwidth Matrix Multiplication: Faster Algorithms and More General Forms of Sparsity
by: Gupta, Chetan, et al.
Published: (2024)
by: Gupta, Chetan, et al.
Published: (2024)
Distributed Genetic Algorithm for Feature Selection
by: Potter, Michael, et al.
Published: (2024)
by: Potter, Michael, et al.
Published: (2024)
Analysis of Distributed Algorithms for Big-data
by: Purohit, Rajendra, et al.
Published: (2024)
by: Purohit, Rajendra, et al.
Published: (2024)
Distributed Ranges: A Model for Distributed Data Structures, Algorithms, and Views
by: Brock, Benjamin, et al.
Published: (2024)
by: Brock, Benjamin, et al.
Published: (2024)
Tracing Distributed Algorithms Using Replay Clocks
by: Lagwankar, Ishaan
Published: (2024)
by: Lagwankar, Ishaan
Published: (2024)
Survey on Token-Based Distributed MutualExclusion Algorithms
by: Tohidi, Elahe, et al.
Published: (2025)
by: Tohidi, Elahe, et al.
Published: (2025)
A Survey of Distributed Graph Algorithms on Massive Graphs
by: Meng, Lingkai, et al.
Published: (2024)
by: Meng, Lingkai, et al.
Published: (2024)
Speedup of Distributed Algorithms for Power Graphs in the CONGEST Model
by: Barenboim, Leonid, et al.
Published: (2023)
by: Barenboim, Leonid, et al.
Published: (2023)
A Seesaw Model Attack Algorithm for Distributed Learning
by: Yang, Kun, et al.
Published: (2024)
by: Yang, Kun, et al.
Published: (2024)
Exploring the Potential of Carbon-Aware Execution for Scientific Workflows
by: West, Kathleen, et al.
Published: (2025)
by: West, Kathleen, et al.
Published: (2025)
Similar Items
-
Distributed Quantum Advantage in Locally Checkable Labeling Problems
by: Balliu, Alkida, et al.
Published: (2025) -
New Hardness Results for the LOCAL Model via a Simple Self-Reduction
by: Balliu, Alkida, et al.
Published: (2025) -
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
by: Balliu, Alkida, et al.
Published: (2025) -
Shared Randomness Helps with Local Distributed Problems
by: Balliu, Alkida, et al.
Published: (2024) -
Tight Lower Bounds in the Supported LOCAL Model
by: Balliu, Alkida, et al.
Published: (2024)