Component stability in low-space massively parallel computation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7033166 (Why is no real title available?)
- scientific article; zbMATH DE number 6297759 (Why is no real title available?)
- A Simple Parallel Algorithm for the Maximal Independent Set Problem
- A lower bound for the distributed Lovász local lemma
- Almost \(k\)-wise independent sample spaces and their cryptologic applications
- An Improved Distributed Algorithm for Maximal Independent Set
- An exponential separation between randomized and deterministic complexity in the LOCAL model
- Communication steps for parallel query processing
- Coresets meet EDCS: algorithms for matching and vertex cover on massive graphs
- Distributed algorithms for the Lovász local lemma and graph coloring
- Distributed coloring algorithms for triangle-free graphs
- Distributed degree splitting, edge coloring, and orientations
- Distributed edge coloring and a special case of the constructive Lovász local lemma
- Equivalence classes and conditional hardness in massively parallel computations
- Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space
- Improved massively parallel computation algorithms for MIS, matching, and vertex cover
- Locality in Distributed Graph Algorithms
- On the Use of Randomness in Local Distributed Graph Algorithms
- On the computational complexity of MapReduce
- Parallel algorithms for geometric graph problems
- Polylogarithmic-time deterministic network decomposition and distributed derandomization
- Pseudorandomness
- 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
- Some simple distributed algorithms for sparse networks
- Sorting, searching, and simulation in the MapReduce framework
- Sparsifying distributed algorithms with ramifications in massively parallel computation and centralized local computation
- Sublogarithmic distributed algorithms for Lovász local lemma, and the complexity hierarchy
- The Complexity of (Δ+1) Coloring in Congested Clique, Massively Parallel Computation, and Centralized Local Computation
- The price of being near-sighted
- What Can be Computed Locally?
This page was built for publication: Component stability in low-space massively parallel computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126138)
