Parallel derandomization for coloring
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A new technique for distributed symmetry breaking
- An Improved Distributed Algorithm for Maximal Independent Set
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- An optimal distributed (+1)-coloring algorithm?
- Communication steps for parallel query processing
- Component stability in low-space massively parallel computation
- Conditional hardness results for massively parallel computation from distributed lower bounds
- Derandomizing local distributed algorithms under bandwidth restrictions
- Deterministic massively parallel connectivity
- Distributed Graph Coloring: Fundamentals and Recent Developments
- Efficient Deterministic Distributed Coloring with Small Bandwidth
- Exponentially faster massively parallel maximal matching
- Fast distributed Brooks' theorem
- Faster Deterministic Distributed Coloring Through Recursive List Coloring
- Faster deterministic distributed MIS and approximate matching
- Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
- Improved Deterministic (Δ+1) Coloring in Low-Space MPC
- Improved distributed algorithms for the Lovász local lemma and edge coloring
- Improved distributed network decomposition, hitting sets, and spanners, via derandomization
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- Locality in Distributed Graph Algorithms
- Massively Parallel Computation of Matching and MIS in Sparse Graphs
- Near-optimal distributed degree+1 coloring
- On derandomizing local distributed algorithms
- Optimal (degree+1)-coloring in congested clique
- Overcoming Congestion in Distributed Coloring
- Parallel algorithms for geometric graph problems
- Parallel graph connectivity in log diameter rounds
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Round compression for parallel matching algorithms
- Shuffles and Circuits (On Lower Bounds for Modern Parallel Computation)
- Simple Constructions of Almost k-wise Independent Random Variables
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPC
- Sorting, searching, and simulation in the MapReduce framework
- Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
- Walking randomly, massively, and efficiently
This page was built for publication: Parallel derandomization for coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7229645)
