Image de couverture de livre

Tight Lower Bounds in the Supported LOCAL Model

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Balliu, Alkida, Boudier, Thomas, Brandt, Sebastian, Olivetti, Dennis
Format:	Preprint
Publié:	2024
Sujets:	Distributed, Parallel, and Cluster Computing
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Towards Fully Automatic Distributed Lower Bounds
par: Balliu, Alkida, et autres
Publié: (2024)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees
par: Balliu, Alkida, et autres
Publié: (2024)

On the Universality of Round Elimination Fixed Points
par: Balliu, Alkida, et autres
Publié: (2025)

New Hardness Results for the LOCAL Model via a Simple Self-Reduction
par: Balliu, Alkida, et autres
Publié: (2025)

Distributed Algorithms for Potential Problems
par: Balliu, Alkida, et autres
Publié: (2025)

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
par: Balliu, Alkida, et autres
Publié: (2024)

The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
par: Balliu, Alkida, et autres
Publié: (2026)

Distributed Computation with Local Advice
par: Balliu, Alkida, et autres
Publié: (2024)

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
par: Balliu, Alkida, et autres
Publié: (2024)

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
par: Balliu, Alkida, et autres
Publié: (2023)

Shared Randomness Helps with Local Distributed Problems
par: Balliu, Alkida, et autres
Publié: (2024)

A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
par: Brandt, Sebastian, et autres
Publié: (2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
par: Balliu, Alkida, et autres
Publié: (2025)

A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
par: Chang, Yi-Jun, et autres
Publié: (2023)

Towards Optimal Deterministic LOCAL Algorithms on Trees
par: Brandt, Sebastian, et autres
Publié: (2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
par: Balliu, Alkida, et autres
Publié: (2025)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
par: El-Hayek, Antoine, et autres
Publié: (2025)

Distributed Quantum Advantage for Local Problems
par: Balliu, Alkida, et autres
Publié: (2024)

Rise and Shine Efficiently! Tight Bounds for Adversarial Wake-up
par: Robinson, Peter, et autres
Publié: (2024)

Orientation does not help with 3-coloring a grid in online-LOCAL
par: Boudier, Thomas, et autres
Publié: (2025)

Tight Bounds on Channel Reliability via Generalized Quorum Systems (Extended Version)
par: Naser-Pastoriza, Alejandro, et autres
Publié: (2025)

Revisiting Lower Bounds for Two-Step Consensus
par: Ryabinin, Fedor, et autres
Publié: (2025)

Tight Bounds on Window Size and Time for Single-Agent Graph Exploration under T-Interval Connectivity
par: Sudo, Yuichi, et autres
Publié: (2026)

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
par: Daas, Hussam Al, et autres
Publié: (2024)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
par: Parzych, Garrett, et autres
Publié: (2024)

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
par: Fraigniaud, Pierre, et autres
Publié: (2025)

A Simple Lower Bound for Set Agreement in Dynamic Networks
par: Fraigniaud, Pierre, et autres
Publié: (2025)

Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
par: Daas, Hussam Al, et autres
Publié: (2026)

Tight Communication Bounds for Distributed Algorithms in the Quantum Routing Model
par: Dufoulon, Fabien, et autres
Publié: (2026)

Tight Conditions for Binary-Output Tasks under Crashes
par: Albouy, Timothé, et autres
Publié: (2025)

Understanding Data Movement in Tightly Coupled Heterogeneous Systems: A Case Study with the Grace Hopper Superchip
par: Fusco, Luigi, et autres
Publié: (2024)

Quantum-Enhanced Distributed Sensor Fusion: Lower Bounds on Aggregation from Projection Noise to Heisenberg-Limited Byzantine-Tolerant Networks
par: Iyer, Vasanth, et autres
Publié: (2026)

The Singular Optimality of Distributed Computation in LOCAL
par: Dufoulon, Fabien, et autres
Publié: (2024)

A New Execution Model and Executor for Adaptively Optimizing the Performance of Parallel Algorithms Using HPX Runtime System
par: Mohammadiporshokooh, Karame, et autres
Publié: (2025)

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
par: Eyraud-Dubois, Lionel, et autres
Publié: (2024)

Tight Bounds on the Message Complexity of Distributed Tree Verification
par: Kutten, Shay, et autres
Publié: (2024)

CausalMesh: A Formally Verified Causally Consistent Distributed Cache with Support for Client Migration
par: Zhang, Haoran, et autres
Publié: (2025)

An Autonomy Loop for Dynamic HPC Job Time Limit Adjustment
par: Jakobsche, Thomas, et autres
Publié: (2025)

Cosmos: A Cost Model for Serverless Workflows in the 3D Compute Continuum
par: Marcelino, Cynthia, et autres
Publié: (2025)

LCLs Beyond Bounded Degrees
par: Schmid, Gustav
Publié: (2026)