Image de couverture de livre

Towards Optimal Deterministic LOCAL Algorithms on Trees

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Brandt, Sebastian, Narayanan, Ananth
Format:	Preprint
Publié:	2025
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

Optimal Deterministic Rendezvous in Labeled Lines
par: Bourreau, Yann, et autres
Publié: (2025)

Tight Lower Bounds in the Supported LOCAL Model
par: Balliu, Alkida, et autres
Publié: (2024)

Deterministic Distributed Algorithms and Measurable Combinatorics on $Δ$-Regular Forests
par: Brandt, Sebastian, et autres
Publié: (2022)

On the Locality of Hall's Theorem
par: Brandt, Sebastian, et autres
Publié: (2025)

Beeping Deterministic CONGEST Algorithms in Graphs
par: Garncarek, Pawel, et autres
Publié: (2025)

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

Towards Fully Automatic Distributed Lower Bounds
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)

Optimal-Length Labeling Schemes for Fast Deterministic Communication in Radio Networks
par: Gańczorz, Adam, et autres
Publié: (2024)

Completing the Node-Averaged Complexity Landscape of LCLs on Trees
par: Balliu, Alkida, 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)

Federated Learning within Global Energy Budget over Heterogeneous Edge Accelerators
par: Banerjee, Roopkatha, et autres
Publié: (2025)

Toward Optimal-Complexity Hash-Based Asynchronous MVBA with Optimal Resilience
par: Komatovic, Jovan, et autres
Publié: (2024)

Optimal, Non-pipelined Reduce-scatter and Allreduce Algorithms
par: Träff, Jesper Larsson
Publié: (2024)

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

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

Deterministic Parallel High-Quality Hypergraph Partitioning
par: Krause, Robert, et autres
Publié: (2025)

Polylog-Competitive Deterministic Local Routing and Scheduling
par: Haeupler, Bernhard, et autres
Publié: (2024)

Deterministic Self-Stabilizing BFS Construction in Constant Space
par: Blin, Lélia, et autres
Publié: (2025)

Deterministic Collision-Free Exploration of Unknown Anonymous Graphs
par: Bhagat, Subhash, et autres
Publié: (2024)

Towards a Standardized Representation for Deep Learning Collective Algorithms
par: Yoo, Jinsun, et autres
Publié: (2024)

Sniffing Helps to Meet: Deterministic Rendezvous of Anonymous Agents in the Grid
par: Gao, Younan, et autres
Publié: (2024)

Deterministic Leader Election for Stationary Programmable Matter with Common Direction
par: Chalopin, Jérémie, et autres
Publié: (2024)

CrossPipe: Towards Optimal Pipeline Schedules for Cross-Datacenter Training
par: Chen, Tiancheng, et autres
Publié: (2025)

NanoFlow: Towards Optimal Large Language Model Serving Throughput
par: Zhu, Kan, et autres
Publié: (2024)

GreediRIS: Scalable Influence Maximization using Distributed Streaming Maximum Cover
par: Barik, Reet, et autres
Publié: (2024)

Deterministic Self-Stabilising Leader Election for Programmable Matter with Constant Memory
par: Chalopin, Jérémie, et autres
Publié: (2024)

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

DRackSim: Simulator for Rack-scale Memory Disaggregation
par: Puri, Amit, et autres
Publié: (2023)

Toward Optimality: A Tighter Analysis of Message Complexity for Leader Election in Diameter-Two Networks
par: Sadhukhan, Abhijit, et autres
Publié: (2026)

Fused Breadth-First Probabilistic Traversals on Distributed GPU Systems
par: Neff, Reece, et autres
Publié: (2023)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
par: Fuchs, Marc, et autres
Publié: (2025)

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

Time-Optimal and Energy-Efficient Deterministic Consensus
par: Meir, Shachar, et autres
Publié: (2025)

Deterministic Bounds in Committee Selection: Enhancing Decentralization and Scalability in Distributed Ledgers
par: Melnikov, Grigorii, et autres
Publié: (2024)

Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components
par: Coleman, Jared, et autres
Publié: (2024)

Benchmarking the Parallel 1D Heat Equation Solver in Chapel, Charm++, C++, HPX, Go, Julia, Python, Rust, Swift, and Java
par: Diehl, Patrick, et autres
Publié: (2023)

Beyond Optimal Fault Tolerance
par: Lewis-Pye, Andrew, et autres
Publié: (2025)

Is a LOCAL algorithm computable?
par: Cruciani, Antonio, et autres
Publié: (2026)

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