Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1708.04290
Cited By
v1
v2 (latest)
The Complexity of Distributed Edge Coloring with Small Palettes
14 August 2017
Yi-Jun Chang
Qizheng He
Wenzheng Li
Seth Pettie
Jara Uitto
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"The Complexity of Distributed Edge Coloring with Small Palettes"
30 / 30 papers shown
Title
Testing Spreading Behavior in Networks with Arbitrary Topologies
S. Chechik
Tianyi Zhang
45
10
0
11 Sep 2023
Fast Coloring Despite Congested Relays
Maxime Flin
Magnús M. Halldórsson
Alexandre Nolin
65
3
0
02 Aug 2023
Edge-Coloring Algorithms for Bounded Degree Multigraphs
A. Dhawan
53
3
0
13 Jul 2023
Borel Vizing's Theorem for Graphs of Subexponential Growth
Anton Bernshteyn
A. Dhawan
142
6
0
30 Jun 2023
Fast algorithms for Vizing's theorem on bounded degree graphs
Anton Bernshteyn
A. Dhawan
76
13
0
09 Mar 2023
The Landscape of Distributed Complexities on Trees and Beyond
Christoph Grunau
Václav Rozhon
S. Brandt
59
20
0
09 Feb 2022
Efficient CONGEST Algorithms for the Lovasz Local Lemma
Yannic Maus
Jara Uitto
55
10
0
05 Aug 2021
Locally Checkable Labelings with Small Messages
Alkida Balliu
K. Censor-Hillel
Yannic Maus
Dennis Olivetti
Jukka Suomela
47
16
0
12 May 2021
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
J. Hirvonen
Laura Schmid
K. Chatterjee
Stefan Schmid
25
0
0
26 Feb 2021
Local Mending
Alkida Balliu
J. Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
LRM
85
9
0
17 Feb 2021
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris
Hsin-Hao Su
H. Vu
73
9
0
22 Sep 2020
A Fast Distributed Algorithm for
(
Δ
+
1
)
(Δ+ 1)
(
Δ
+
1
)
-Edge-Coloring
Anton Bernshteyn
73
1
0
28 Jun 2020
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
54
12
0
25 Feb 2020
Truly Tight-in-
Δ
Δ
Δ
Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
45
26
0
19 Feb 2020
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
67
5
0
14 Feb 2020
Classification of distributed binary labeling problems
Alkida Balliu
S. Brandt
Yuval Efron
J. Hirvonen
Yannic Maus
Dennis Olivetti
Jukka Suomela
56
44
0
29 Nov 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Will Rosenbaum
Jukka Suomela
60
15
0
18 Jul 2019
Faster Deterministic Distributed Coloring Through Recursive List Coloring
Fabian Kuhn
56
34
0
08 Jul 2019
Locality of not-so-weak coloring
Alkida Balliu
J. Hirvonen
Christoph Lenzen
Dennis Olivetti
Jukka Suomela
33
12
0
11 Apr 2019
An Automatic Speedup Theorem for Distributed Problems
S. Brandt
22
56
0
26 Feb 2019
How much does randomness help with locally checkable problems?
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
45
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
70
98
0
08 Jan 2019
Towards the Locality of Vizing's Theorem
Hsin-Hao Su
H. Vu
67
29
0
02 Jan 2019
Hardness of minimal symmetry breaking in distributed computing
Alkida Balliu
J. Hirvonen
Dennis Olivetti
Jukka Suomela
71
32
0
05 Nov 2018
Almost Global Problems in the LOCAL Model
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
62
44
0
12 May 2018
Deterministic Distributed Edge-Coloring with Fewer Colors
M. Ghaffari
Fabian Kuhn
Yannic Maus
Jara Uitto
41
54
0
15 Nov 2017
On Derandomizing Local Distributed Algorithms
M. Ghaffari
David G. Harris
Fabian Kuhn
OOD
FedML
75
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
49
57
0
06 Nov 2017
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
61
102
0
20 Apr 2017
Distributed
(
Δ
+
1
)
(Δ+1)
(
Δ
+
1
)
-Coloring in Sublogarithmic Rounds
David G. Harris
Johannes Schneider
Hsin-Hao Su
OOD
69
11
0
04 Mar 2016
1