Imagen de Portada

Towards Fully Automatic Distributed Lower Bounds

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Balliu, Alkida, Brandt, Sebastian, Kuhn, Fabian, Olivetti, Dennis, Saarhelo, Joonatan
Formato:	Preprint
Publicado:	2024
Materias:	Distributed, Parallel, and Cluster Computing
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tight Lower Bounds in the Supported LOCAL Model
por: Balliu, Alkida, et al.
Publicado: (2024)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees
por: Balliu, Alkida, et al.
Publicado: (2024)

Distributed Computation with Local Advice
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)

On the Universality of Round Elimination Fixed Points
por: Balliu, Alkida, et al.
Publicado: (2025)

Solving Sequential Greedy Problems Distributedly with Sub-Logarithmic Energy Cost
por: Balliu, Alkida, et al.
Publicado: (2024)

Distributed Algorithms for Potential Problems
por: Balliu, Alkida, et al.
Publicado: (2025)

Asynchronous Fault-Tolerant Distributed Proper Coloring of Graphs
por: Balliu, Alkida, et al.
Publicado: (2024)

Shared Randomness Helps with Local Distributed Problems
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)

New Hardness Results for the LOCAL Model via a Simple Self-Reduction
por: Balliu, Alkida, et al.
Publicado: (2025)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
por: Balliu, Alkida, et al.
Publicado: (2025)

A Post-Quantum Lower Bound for the Distributed Lovász Local Lemma
por: Brandt, Sebastian, et al.
Publicado: (2025)

Distributed Quantum Advantage in Locally Checkable Labeling Problems
por: Balliu, Alkida, et al.
Publicado: (2025)

Distributed Quantum Advantage for Local Problems
por: Balliu, Alkida, et al.
Publicado: (2024)

Towards Optimal Deterministic LOCAL Algorithms on Trees
por: Brandt, Sebastian, et al.
Publicado: (2025)

Distributed $(Δ+1)$-Coloring in Graphs of Bounded Neighborhood Independence
por: Fuchs, Marc, et al.
Publicado: (2025)

Revisiting Lower Bounds for Two-Step Consensus
por: Ryabinin, Fedor, et al.
Publicado: (2025)

Highly Dynamic and Fully Distributed Data Structures
por: Augustine, John, et al.
Publicado: (2024)

Communication Lower Bounds and Optimal Algorithms for Symmetric Matrix Computations
por: Daas, Hussam Al, et al.
Publicado: (2024)

Memory Lower Bounds and Impossibility Results for Anonymous Dynamic Broadcast
por: Parzych, Garrett, et al.
Publicado: (2024)

Lower Bounds for $k$-Set Agreement in Fault-Prone Networks
por: Fraigniaud, Pierre, et al.
Publicado: (2025)

A Simple Lower Bound for Set Agreement in Dynamic Networks
por: Fraigniaud, Pierre, et al.
Publicado: (2025)

Communication Lower Bounds and Algorithms for Sketching with Random Dense Matrices
por: Daas, Hussam Al, et al.
Publicado: (2026)

Quantum-Enhanced Distributed Sensor Fusion: Lower Bounds on Aggregation from Projection Noise to Heisenberg-Limited Byzantine-Tolerant Networks
por: Iyer, Vasanth, et al.
Publicado: (2026)

Fully-Distributed Construction of Byzantine-Resilient Dynamic Peer-to-Peer Networks
por: Gupta, Aayush, et al.
Publicado: (2025)

Galvatron: Automatic Distributed Training for Large Transformer Models
por: Gumaan, Esmail
Publicado: (2025)

SSSP-Del: Fully Dynamic Distributed Algorithm for Single-Source Shortest Path
por: Javanrood, Parshan, et al.
Publicado: (2025)

An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model
por: El-Hayek, Antoine, et al.
Publicado: (2025)

Bounding Distance Between Outputs in Distributed Lattice Agreement
por: Rasheed, Abdullah, et al.
Publicado: (2025)

DistFlow: A Fully Distributed RL Framework for Scalable and Efficient LLM Post-Training
por: Wang, Zhixin, et al.
Publicado: (2025)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
por: Brandt, Sebastian, et al.
Publicado: (2022)

Towards Affordable, Adaptive and Automatic GNN Training on CPU-GPU Heterogeneous Platforms
por: Qiao, Tong, et al.
Publicado: (2025)

Fully Lattice-Linear Algorithms
por: Gupta, Arya Tanmay, et al.
Publicado: (2022)

Deterministic Lower Bounds for $k$-Edge Connectivity in the Distributed Sketching Model
por: Robinson, Peter, et al.
Publicado: (2025)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
por: Bourreau, Yann, et al.
Publicado: (2025)

Tightening I/O Lower Bounds through the Hourglass Dependency Pattern
por: Eyraud-Dubois, Lionel, et al.
Publicado: (2024)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
por: Bourreau, Yann, et al.
Publicado: (2025)

Towards Efficient and Scalable Distributed Vector Search with RDMA
por: Zhi, Xiangyu, et al.
Publicado: (2025)

Toward Heterogeneous, Distributed, and Energy-Efficient Computing with SYCL
por: Cosenza, Biagio, et al.
Publicado: (2025)