Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1602.08166
Cited By
v1
v2 (latest)
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
26 February 2016
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model"
50 / 53 papers shown
Title
Simpler and More General Distributed Coloring Based on Simple List Defective Coloring Algorithms
Marc Fuchs
Fabian Kuhn
44
1
0
07 May 2024
Tight Lower Bounds in the Supported LOCAL Model
Alkida Balliu
Thomas Boudier
Sebastian Brandt
Dennis Olivetti
57
1
0
01 May 2024
Borel versions of the Local Lemma and LOCAL algorithms for graphs of finite asymptotic separation index
Anton Bernshteyn
F. Weilacher
53
6
0
28 Aug 2023
Recurrent Problems in the LOCAL model
A. Agrawal
John E. Augustine
David Peleg
Srikkanth Ramachandran
55
1
0
30 Dec 2022
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
51
17
0
14 Nov 2022
Exponential Speedup Over Locality in MPC with Optimal Memory
Alkida Balliu
S. Brandt
Manuela Fischer
R. Latypov
Yannic Maus
Dennis Olivetti
Jara Uitto
59
5
0
19 Aug 2022
Efficient Classification of Locally Checkable Problems in Regular Trees
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
47
8
0
17 Feb 2022
Improved Deterministic
(
Δ
+
1
)
(Δ+1)
(
Δ
+
1
)
-Coloring in Low-Space MPC
A. Czumaj
Peter Davies
M. Parter
56
21
0
10 Dec 2021
Near-Optimal Distributed Degree+1 Coloring
Magnús M. Halldórsson
Fabian Kuhn
Alexandre Nolin
Tigran Tonoyan
55
39
0
01 Dec 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus
Jara Uitto
55
10
0
05 Aug 2021
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
42
18
0
04 Jun 2021
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
58
24
0
03 Jun 2021
Distributed Graph Coloring Made Easy
Yannic Maus
56
25
0
12 May 2021
Locally Checkable Labelings with Small Messages
Alkida Balliu
K. Censor-Hillel
Yannic Maus
Dennis Olivetti
Jukka Suomela
47
16
0
12 May 2021
Ultrafast Distributed Coloring of High Degree Graphs
Magnús M. Halldórsson
Alexandre Nolin
Tigran Tonoyan
27
7
0
10 May 2021
The randomized local computation complexity of the Lovász local lemma
S. Brandt
Christoph Grunau
Václav Rozhon
49
10
0
30 Mar 2021
Locally Checkable Problems in Rooted Trees
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
A. Tereshchenko
70
28
0
18 Feb 2021
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms
Anton Bernshteyn
57
17
0
17 Feb 2021
Local Mending
Alkida Balliu
J. Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
LRM
70
9
0
17 Feb 2021
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
Yi-Jun Chang
LRM
44
31
0
21 Sep 2020
High-Performance Parallel Graph Coloring with Strong Guarantees on Work, Depth, and Quality
Maciej Besta
Armon Carigiet
Zur Vonarburg-Shmaria
Kacper Janda
Lukas Gianinazzi
Torsten Hoefler
97
25
0
26 Aug 2020
Improved Deterministic Network Decomposition
M. Ghaffari
Christoph Grunau
Václav Rozhon
56
82
0
16 Jul 2020
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
S. Brandt
Christoph Grunau
Václav Rozhon
50
11
0
08 Jun 2020
Truly Tight-in-
Δ
Δ
Δ
Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
39
26
0
19 Feb 2020
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
53
4
0
14 Feb 2020
Classification of distributed binary labeling problems
Alkida Balliu
S. Brandt
Yuval Efron
J. Hirvonen
Yannic Maus
Dennis Olivetti
Jukka Suomela
51
44
0
29 Nov 2019
Introduction to local certification
Laurent Feuilloley
70
34
0
28 Oct 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
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Will Rosenbaum
Jukka Suomela
53
15
0
18 Jul 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring
Fabian Kuhn
56
34
0
08 Jul 2019
On the Use of Randomness in Local Distributed Graph Algorithms
M. Ghaffari
Fabian Kuhn
33
7
0
02 Jun 2019
On the Complexity of Distributed Splitting Problems
P. Bamberger
M. Ghaffari
Fabian Kuhn
Yannic Maus
Jara Uitto
53
7
0
28 May 2019
Optimal Distributed Covering Algorithms
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
33
13
0
25 Feb 2019
Fast Deterministic Algorithms for Highly-Dynamic Networks
K. Censor-Hillel
Neta Dafni
V. I. Kolobov
A. Paz
Gregory Schwartzman
55
5
0
13 Jan 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
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
59
29
0
07 Jan 2019
On the Power of Preprocessing in Decentralized Network Optimization
Klaus-Tycho Foerster
J. Hirvonen
Stefan Schmid
Jukka Suomela
28
20
0
03 Dec 2018
Hardness of minimal symmetry breaking in distributed computing
Alkida Balliu
J. Hirvonen
Dennis Olivetti
Jukka Suomela
66
32
0
05 Nov 2018
Optimal Distributed Weighted Set Cover Approximation
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
26
1
0
17 Aug 2018
Almost Global Problems in the LOCAL Model
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
52
44
0
12 May 2018
Improved Distributed
Δ
Δ
Δ
-Coloring
M. Ghaffari
J. Hirvonen
Fabian Kuhn
Yannic Maus
39
39
0
08 Mar 2018
On Derandomizing Local Distributed Algorithms
M. Ghaffari
David G. Harris
Fabian Kuhn
OOD
FedML
61
137
0
06 Nov 2017
New Classes of Distributed Time Complexity
Alkida Balliu
J. Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
Dennis Olivetti
Jukka Suomela
39
57
0
06 Nov 2017
An Optimal Distributed
(
Δ
+
1
)
(Δ+1)
(
Δ
+
1
)
-Coloring Algorithm?
Yi-Jun Chang
Wenzheng Li
Seth Pettie
OOD
62
81
0
03 Nov 2017
The Complexity of Distributed Edge Coloring with Small Palettes
Yi-Jun Chang
Qizheng He
Wenzheng Li
Seth Pettie
Jara Uitto
125
50
0
14 Aug 2017
Improved Distributed Degree Splitting and Edge Coloring
M. Ghaffari
J. Hirvonen
Fabian Kuhn
Yannic Maus
Jukka Suomela
Jara Uitto
119
27
0
15 Jun 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
75
55
0
16 May 2017
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
50
102
0
20 Apr 2017
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
Laurent Feuilloley
49
14
0
19 Apr 2017
LCL problems on grids
S. Brandt
J. Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
P. Östergård
Christopher Purcell
Joel Rybicki
Jukka Suomela
P. Uznański
LRM
55
59
0
17 Feb 2017
1
2
Next