Parallel derandomization for coloring
Open Access
- 19 March 2026
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 1073
Abstract
No abstract availableFunding Information
- Engineering and Physical Sciences Research Council (UKRI155)
- Engineering and Physical Sciences Research Council (EP/V01305X/1)
- IBM Research
- Simons Foundation (663281)
- Centre for Discrete Mathematics and its Applications, University of Warwick
- Polska Akademia Nauk
- Weizmann Institute of Science
This publication has 13 references indexed in Scilit:
- Component stability in low-space massively parallel computationDistributed Computing, 2024
- Improved Distributed Network Decomposition, Hitting Sets, and Spanners, via Derandomization2023
- Simple, Deterministic, Constant-Round Coloring in Congested Clique and MPCSIAM Journal on Computing, 2021
- Derandomizing local distributed algorithms under bandwidth restrictionsDistributed Computing, 2020
- An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL ModelSIAM Journal on Computing, 2019
- MapReduceCommunications of the ACM, 2008
- DryadACM SIGOPS Operating Systems Review, 2007
- Locality in Distributed Graph AlgorithmsSIAM Journal on Computing, 1992
- Simple Constructions of Almost k‐wise Independent Random VariablesRandom Structures & Algorithms, 1992
- A Simple Parallel Algorithm for the Maximal Independent Set ProblemSIAM Journal on Computing, 1986