Distributed Computation with Local Advice
Fuente:
arXiv
Guardado en:
| Autores principales: | Balliu, Alkida, Brandt, Sebastian, Kuhn, Fabian, Nowicki, Krzysztof, Olivetti, Dennis, Rotenberg, Eva, Suomela, Jukka |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
On the Universality of Round Elimination Fixed Points
por: Balliu, Alkida, et al.
Publicado: (2025)
por: Balliu, Alkida, et al.
Publicado: (2025)
Shared Randomness Helps with Local Distributed Problems
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
Towards Fully Automatic Distributed Lower Bounds
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
Distributed Algorithms for Potential Problems
por: Balliu, Alkida, et al.
Publicado: (2025)
por: Balliu, Alkida, et al.
Publicado: (2025)
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
Tight Lower Bounds in the Supported LOCAL Model
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
por: Balliu, Alkida, et al.
Publicado: (2026)
por: Balliu, Alkida, et al.
Publicado: (2026)
Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
por: Balliu, Alkida, et al.
Publicado: (2023)
por: Balliu, Alkida, et al.
Publicado: (2023)
Distributed Quantum Advantage in Locally Checkable Labeling Problems
por: Balliu, Alkida, et al.
Publicado: (2025)
por: Balliu, Alkida, et al.
Publicado: (2025)
New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
por: Balliu, Alkida, et al.
Publicado: (2025)
por: Balliu, Alkida, et al.
Publicado: (2025)
Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
New Hardness Results for the LOCAL Model via a Simple Self-Reduction
por: Balliu, Alkida, et al.
Publicado: (2025)
por: Balliu, Alkida, et al.
Publicado: (2025)
Distributed Quantum Advantage for Local Problems
por: Balliu, Alkida, et al.
Publicado: (2024)
por: Balliu, Alkida, et al.
Publicado: (2024)
It does not matter how you define locally checkable labelings
por: Cruciani, Antonio, et al.
Publicado: (2026)
por: Cruciani, Antonio, et al.
Publicado: (2026)
Classification of Local Optimization Problems in Directed Cycles
por: Boudier, Thomas, et al.
Publicado: (2026)
por: Boudier, Thomas, et al.
Publicado: (2026)
Local problems in trees across a wide range of distributed models
por: Dhar, Anubhav, et al.
Publicado: (2024)
por: Dhar, Anubhav, et al.
Publicado: (2024)
A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
por: Brandt, Sebastian, et al.
Publicado: (2025)
por: Brandt, Sebastian, et al.
Publicado: (2025)
Local Density and its Distributed Approximation
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)
por: Christiansen, Aleksander Bjørn, et al.
Publicado: (2024)
Meta-Theorems for Cuttable Distributed Problems
por: Bonamy, Marthe, et al.
Publicado: (2026)
por: Bonamy, Marthe, et al.
Publicado: (2026)
Online Locality Meets Distributed Quantum Computing
por: Akbari, Amirreza, et al.
Publicado: (2024)
por: Akbari, Amirreza, et al.
Publicado: (2024)
Is a LOCAL algorithm computable?
por: Cruciani, Antonio, et al.
Publicado: (2026)
por: Cruciani, Antonio, et al.
Publicado: (2026)
Towards Optimal Deterministic LOCAL Algorithms on Trees
por: Brandt, Sebastian, et al.
Publicado: (2025)
por: Brandt, Sebastian, et al.
Publicado: (2025)
Self-Organizing Edge Computing Distribution Framework for Visual SLAM
por: Kalliola, Jussi, et al.
Publicado: (2025)
por: Kalliola, Jussi, et al.
Publicado: (2025)
2-Coloring Cycles in One Round
por: Flin, Maxime, et al.
Publicado: (2026)
por: Flin, Maxime, et al.
Publicado: (2026)
Supervised Distributed Computing
por: Augustine, John, et al.
Publicado: (2025)
por: Augustine, John, et al.
Publicado: (2025)
Towards Learning-Augmented Peer-to-Peer Networks: Self-Stabilizing Graph Linearization with Untrusted Advice
por: Aradhya, Vijeth, et al.
Publicado: (2025)
por: Aradhya, Vijeth, et al.
Publicado: (2025)
A Study on the Performance of Distributed Training of Data-driven CFD Simulations
por: Iserte, Sergio, et al.
Publicado: (2026)
por: Iserte, Sergio, et al.
Publicado: (2026)
The Topology of Local Computing in Networks
por: Fraigniaud, Pierre, et al.
Publicado: (2020)
por: Fraigniaud, Pierre, et al.
Publicado: (2020)
Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
por: Brandt, Sebastian, et al.
Publicado: (2022)
por: Brandt, Sebastian, et al.
Publicado: (2022)
I Like To Move It -- Computation Instead of Data in the Brain
por: Czappa, Fabian, et al.
Publicado: (2025)
por: Czappa, Fabian, et al.
Publicado: (2025)
Error-resilient Distributed Local Verification
por: Garncarek, Paweł, et al.
Publicado: (2026)
por: Garncarek, Paweł, et al.
Publicado: (2026)
The Singular Optimality of Distributed Computation in LOCAL
por: Dufoulon, Fabien, et al.
Publicado: (2024)
por: Dufoulon, Fabien, et al.
Publicado: (2024)
Distributed Load Orchestration for Vision Computing in Multi-Access Edge Computing
por: Boing, Ricardo N., et al.
Publicado: (2022)
por: Boing, Ricardo N., et al.
Publicado: (2022)
AI Surrogate Model for Distributed Computing Workloads
por: Park, David K., et al.
Publicado: (2024)
por: Park, David K., et al.
Publicado: (2024)
Barycentric Coded Distributed Computing with Flexible Recovery Threshold for Collaborative Mobile Edge Computing
por: Qiu, Houming, et al.
Publicado: (2025)
por: Qiu, Houming, et al.
Publicado: (2025)
Exploiting Stragglers in Distributed Computing Systems with Task Grouping
por: Adikari, Tharindu, et al.
Publicado: (2024)
por: Adikari, Tharindu, et al.
Publicado: (2024)
Composing Distributed Computations Through Task and Kernel Fusion
por: Yadav, Rohan, et al.
Publicado: (2024)
por: Yadav, Rohan, et al.
Publicado: (2024)
Scheduling of Distributed Applications on the Computing Continuum: A Survey
por: Mehran, Narges, et al.
Publicado: (2024)
por: Mehran, Narges, et al.
Publicado: (2024)
A Quick and Exact Method for Distributed Quantile Computation
por: Cao, Ivan, et al.
Publicado: (2025)
por: Cao, Ivan, et al.
Publicado: (2025)
Ejemplares similares
-
On the Universality of Round Elimination Fixed Points
por: Balliu, Alkida, et al.
Publicado: (2025) -
Shared Randomness Helps with Local Distributed Problems
por: Balliu, Alkida, et al.
Publicado: (2024) -
Towards Fully Automatic Distributed Lower Bounds
por: Balliu, Alkida, et al.
Publicado: (2024) -
Distributed Algorithms for Potential Problems
por: Balliu, Alkida, et al.
Publicado: (2025) -
Completing the Node-Averaged Complexity Landscape of LCLs on Trees
por: Balliu, Alkida, et al.
Publicado: (2024)