Cover Image

On the Universality of Round Elimination Fixed Points

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balliu, Alkida, Brandt, Sebastian, Gabsdil, Ole, Olivetti, Dennis, Suomela, Jukka
Format:	Preprint
Published:	2025
Subjects:	Distributed, Parallel, and Cluster Computing
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Distributed Computation with Local Advice
by: Balliu, Alkida, et al.
Published: (2024)

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

Towards Fully Automatic Distributed Lower Bounds
by: Balliu, Alkida, et al.
Published: (2024)

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

Distributed Algorithms for Potential Problems
by: Balliu, Alkida, et al.
Published: (2025)

Shared Randomness Helps with Local Distributed Problems
by: Balliu, Alkida, et al.
Published: (2024)

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

The Distributed Complexity Landscape on Trees Depends on the Knowledge About the Network Size
by: Balliu, Alkida, et al.
Published: (2026)

New Limits on Distributed Quantum Advantage: Dequantizing Linear Programs
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)

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

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

On the Node-Averaged Complexity of Locally Checkable Problems on Trees
by: Balliu, Alkida, et al.
Published: (2023)

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

It does not matter how you define locally checkable labelings
by: Cruciani, Antonio, et al.
Published: (2026)

2-Coloring Cycles in One Round
by: Flin, Maxime, et al.
Published: (2026)

Local problems in trees across a wide range of distributed models
by: Dhar, Anubhav, et al.
Published: (2024)

Is a LOCAL algorithm computable?
by: Cruciani, Antonio, et al.
Published: (2026)

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

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

Meta-Theorems for Cuttable Distributed Problems
by: Bonamy, Marthe, et al.
Published: (2026)

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
by: Khoury, Seri, et al.
Published: (2025)

Oblivious Robots Under Round Robin: Gathering on Rings
by: Navarra, Alfredo, et al.
Published: (2025)

Universal Workers: A Vision for Eliminating Cold Starts in Serverless Computing
by: Akbari, Saman, et al.
Published: (2025)

Round and Resilience-Optimal Approximate Agreement on Trees and Block Graphs
by: Fuchs, Marc, et al.
Published: (2025)

Round-optimal $n$-Block Broadcast Schedules in Logarithmic Time
by: Träff, Jesper Larsson
Published: (2023)

Balancing Fixed Number of Nodes Among Multiple Fixed Clusters
by: Ranjan, Paritosh, et al.
Published: (2025)

Eliminating Hidden Serialization in Multi-Node Megakernel Communication
by: Oh, Byungsoo, et al.
Published: (2026)

Classification of Local Optimization Problems in Directed Cycles
by: Boudier, Thomas, et al.
Published: (2026)

Communication Round and Computation Efficient Exclusive Prefix-Sums Algorithms (for MPI_Exscan)
by: Träff, Jesper Larsson
Published: (2025)

Parameterized Verification of Round-based Distributed Algorithms via Extended Threshold Automata
by: Baumeister, Tom, et al.
Published: (2024)

Gathering in Vertex- and Edge-Transitive Graphs without Multiplicity Detection under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

Scaling LLM Inference Beyond Amdahl`s Limits via Eliminating Non-Scalable Overheads
by: Zhao, Alan, et al.
Published: (2026)

Eliminating Timing Anomalies in Scheduling Periodic Segmented Self-Suspending Tasks with Release Jitter
by: Lin, Ching-Chi, et al.
Published: (2024)

Ocior: Ultra-Fast Asynchronous Leaderless Consensus with Two-Round Finality, Linear Overhead, and Adaptive Security
by: Chen, Jinyuan
Published: (2025)

Carbon-Aware Workflow Scheduling with Fixed Mapping and Deadline Constraint
by: Schweisgut, Dominik, et al.
Published: (2025)

A New Execution Model and Executor for Adaptively Optimizing the Performance of Parallel Algorithms Using HPX Runtime System
by: Mohammadiporshokooh, Karame, et al.
Published: (2025)

Gathering in Non-Vertex-Transitive Graphs Under Round Robin
by: Cicerone, Serafino, et al.
Published: (2025)

Making Democracy Work: Fixing and Simplifying Egalitarian Paxos (Extended Version)
by: Ryabinin, Fedor, et al.
Published: (2025)

Advancing RT Core-Accelerated Fixed-Radius Nearest Neighbor Search
by: Meneses, Enzo, et al.
Published: (2026)