Faster deterministic distributed MIS and approximate matching
From MaRDI portal
Publication:6499340
DOI10.1145/3564246.3585243WikidataQ130838886 ScholiaQ130838886MaRDI QIDQ6499340FDOQ6499340
Authors: Mohsen Ghaffari, Christoph Grunau 
Publication date: 8 May 2024
Cites Work
- Distributed Computing: A Locality-Sensitive Approach
- Complexity of network synchronization
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A fast and simple randomized parallel algorithm for the maximal independent set problem
- Locality in Distributed Graph Algorithms
- Low diameter graph decompositions
- Fast randomized algorithms for distributed edge coloring (extended abstract)
- On the distributed complexity of computing maximal matchings
- Removing randomness in parallel computation without a processor penalty
- Lower Bounds for Maximal Matchings and Maximal Independent Sets
- Fast distributed network decompositions and covers
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- On the locality of some NP-complete problems
- Distributed Strong Diameter Network Decomposition
- Efficient Deterministic Distributed Coloring with Small Bandwidth
- On the complexity of local distributed graph problems
- An optimal distributed \((\Delta+1)\)-coloring algorithm?
- Improved deterministic distributed matching via rounding
- Derandomizing local distributed algorithms under bandwidth restrictions
- Derandomizing distributed algorithms with small messages: spanners and dominating set
This page was built for publication: Faster deterministic distributed MIS and approximate matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6499340)
