Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space

DOI10.1145/3451992OpenAlexW3167599539MaRDI QIDQ5032024

Peter Davies, Artur Czumaj, Merav Parter

Publication date: 16 February 2022

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1912.05390

zbMATH Keywords

derandomizationmaximal matchingsparsificationmaximal independent setmassively parallel computation

Mathematics Subject Classification ID

Computer science (68-XX)

Related Items (4)

Equivalence classes and conditional hardness in massively parallel computations ⋮ Deterministic Massively Parallel Connectivity ⋮ Component stability in low-space massively parallel computation ⋮ Superfast coloring in CONGEST via efficient color sampling

This page was built for publication: Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space