Polylogarithmic-Time Deterministic Network Decomposition and Distributed
Derandomization

v1v2 (latest)

Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization

25 July 2019

ArXiv (abs)PDF HTML

Papers citing "Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization"

11 / 111 papers shown

Title
Distributed graph problems through an automata-theoretic lens Yi-Jun Chang Jan Studený Jukka Suomela 57 20 0 18 Feb 2020
A Breezing Proof of the KMW Bound Corinna Coupette Christoph Lenzen 55 4 0 14 Feb 2020
Graph Sparsification for Derandomizing Massively Parallel Computation with Low Space A. Czumaj Peter Davies M. Parter 83 29 0 11 Dec 2019
Classification of distributed binary labeling problems Alkida Balliu S. Brandt Yuval Efron J. Hirvonen Yannic Maus Dennis Olivetti Jukka Suomela 53 44 0 29 Nov 2019
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma S. Brandt Yannic Maus Jara Uitto 50 10 0 17 Aug 2019
Small Cuts and Connectivity Certificates: A Fault Tolerant Approach M. Parter 68 28 0 08 Aug 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems Will Rosenbaum Jukka Suomela 53 15 0 18 Jul 2019
Improved Distributed Approximations for Maximum Independent Set Ken-ichi Kawarabayashi Seri Khoury Aaron Schild Gregory Schwartzman 50 9 0 27 Jun 2019
How much does randomness help with locally checkable problems? Alkida Balliu S. Brandt Dennis Olivetti Jukka Suomela 38 32 0 18 Feb 2019
Lower bounds for maximal matchings and maximal independent sets Alkida Balliu S. Brandt J. Hirvonen Dennis Olivetti Mikael Rabie Jukka Suomela FedML 55 98 0 08 Jan 2019
Improved Distributed $Δ$ -Coloring M. Ghaffari J. Hirvonen Fabian Kuhn Yannic Maus 42 39 0 08 Mar 2018