1. Distributed Algorithms for Coloring Interval Graphs;Halldórsson,2014
2. Reducibility among combinatorial problems;Karp,1972
3. Linear degree extractors and the inapproximability of max clique and chromatic number;Zuckerman;Theory Comput.,2007
4. A fast network-decomposition algorithm and its applications to constant-time distributed computation;Barenboim,2015
5. An exponential separation between randomized and deterministic complexity in the local model;Chang,2016