Image de couverture de livre

Breaking Barriers for Distributed MIS by Faster Degree Reduction

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Khoury, Seri, Schild, Aaron
Format:	Preprint
Publié:	2025
Sujets:	Distributed, Parallel, and Cluster Computing Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Round Elimination via Self-Reduction: Closing Gaps for Distributed Maximal Matching
par: Khoury, Seri, et autres
Publié: (2025)

On the Randomized Locality of Matching Problems in Regular Graphs
par: Khoury, Seri, et autres
Publié: (2025)

Faster Distributed $Δ$-Coloring via a Reduction to MIS
par: Bourreau, Yann, et autres
Publié: (2025)

Faster Parallel Batch-Dynamic Algorithms for Low Out-Degree Orientation
par: Blelloch, Guy, et autres
Publié: (2026)

On Distributed Computation of the Minimum Triangle Edge Transversal
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Fast Deterministic Distributed Degree Splitting
par: Maus, Yannic, et autres
Publié: (2026)

Faster Distributed $Δ$-Coloring via Ruling Subgraphs
par: Bourreau, Yann, et autres
Publié: (2025)

When MIS and Maximal Matching are Easy in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2025)

Faster Cycle Detection in the Congested Clique
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Near-Optimal Deterministic Network Decomposition and Ruling Set, and Improved MIS
par: Ghaffari, Mohsen, et autres
Publié: (2024)

Distributed Reductions for the Maximum Weight Independent Set Problem
par: Borowitz, Jannick, et autres
Publié: (2025)

Deterministic Expander Routing: Faster and More Versatile
par: Chang, Yi-Jun, et autres
Publié: (2024)

Towards True Work-Efficiency in Parallel Derandomization: MIS, Maximal Matching, and Hitting Set
par: Ghaffari, Mohsen, et autres
Publié: (2025)

Faster Multi-Source Reachability and Approximate Distances via Shortcuts, Hopsets and Matrix Multiplication
par: Elkin, Michael, et autres
Publié: (2025)

Energy-Efficient Aggregation and Minimum-Degree Spanning Trees in Radio Networks
par: Chang, Yi-Jun, et autres
Publié: (2026)

TC-MIS: Maximal Independent Set on Tensor-cores
par: Nijhara, Prajjwal, et autres
Publié: (2026)

Parallel, Distributed, and Quantum Exact Single-Source Shortest Paths with Negative Edge Weights
par: Ashvinkumar, Vikrant, et autres
Publié: (2023)

Optimal Distributed Replacement Paths
par: Chang, Yi-Jun, et autres
Publié: (2025)

Bounded Memory in Distributed Networks
par: Basat, Ran Ben, et autres
Publié: (2025)

Distributed Graph Algorithms with Predictions
par: Boyar, Joan, et autres
Publié: (2025)

Distributed Stochastic Graph Algorithms
par: Censor-Hillel, Keren, et autres
Publié: (2026)

Towards Optimal Distributed Delta Coloring
par: Jakob, Manuel, et autres
Publié: (2025)

Distributed Maximum Flow in Planar Graphs
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2024)

Meta-Theorems for Cuttable Distributed Problems
par: Bonamy, Marthe, et autres
Publié: (2026)

Distributed Subgraph Finding: Progress and Challenges
par: Censor-Hillel, Keren
Publié: (2022)

Local Density and its Distributed Approximation
par: Christiansen, Aleksander Bjørn, et autres
Publié: (2024)

$k$-Center Clustering in Distributed Models
par: Biabani, Leyla, et autres
Publié: (2024)

Congested Clique Counting for Local Gibbs Distributions
par: Sobel, Joshua Z.
Publié: (2025)

A Simple and Robust Protocol for Distributed Counting
par: Cohen, Edith, et autres
Publié: (2025)

Distributed Santa Claus via Global Rounding
par: de Vos, Tijn, et autres
Publié: (2026)

The Local Information Cost of Distributed Graph Spanners
par: Robinson, Peter
Publié: (2020)

Distributed Delta-Coloring under Bandwidth Limitations
par: Maus, Yannic, et autres
Publié: (2024)

Fully-Distributed Byzantine Agreement in Sparse Networks
par: Augustine, John, et autres
Publié: (2024)

A Simple Distributed Deterministic Planar Separator
par: Abd-Elhaleem, Yaseen, et autres
Publié: (2026)

Towards Optimal Distributed Edge Coloring with Fewer Colors
par: Jakob, Manuel, et autres
Publié: (2025)

Distributed Interactive Proofs for Planarity with Log-Star Communication
par: Gil, Yuval, et autres
Publié: (2025)

Sublogarithmic Distributed Vertex Coloring with Optimal Number of Colors
par: Flin, Maxime, et autres
Publié: (2026)

Distributed Lovász Local Lemma under Bandwidth Limitations
par: Halldórsson, Magnús M., et autres
Publié: (2024)

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

Near-Resolution of the Tradeoff Conjecture in Distributed Proof Labeling Schemes
par: Filtser, Arnold, et autres
Publié: (2026)