ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1511.00900
  4. Cited By
A Lower Bound for the Distributed Lovász Local Lemma

A Lower Bound for the Distributed Lovász Local Lemma

3 November 2015
S. Brandt
Orr Fischer
J. Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
ArXiv (abs)PDFHTML

Papers citing "A Lower Bound for the Distributed Lovász Local Lemma"

49 / 49 papers shown
Title
Distributed Lovász Local Lemma under Bandwidth Limitations
Distributed Lovász Local Lemma under Bandwidth Limitations
Magnús M. Halldórsson
Yannic Maus
Saku Peltonen
62
2
0
12 May 2024
Simpler and More General Distributed Coloring Based on Simple List
  Defective Coloring Algorithms
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
Tight Lower Bounds in the Supported LOCAL Model
Alkida Balliu
Thomas Boudier
Sebastian Brandt
Dennis Olivetti
57
1
0
01 May 2024
Fast Distributed Brooks' Theorem
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
51
17
0
14 Nov 2022
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
62
8
0
03 Nov 2022
Exponential Speedup Over Locality in MPC with Optimal Memory
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
Fast Distributed Vertex Splitting with Applications
Fast Distributed Vertex Splitting with Applications
Magnús M. Halldórsson
Yannic Maus
Alexandre Nolin
56
8
0
17 Aug 2022
Efficient Classification of Locally Checkable Problems in Regular Trees
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 Distributed Fractional Coloring Algorithms
Improved Distributed Fractional Coloring Algorithms
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
79
5
0
08 Dec 2021
Efficient CONGEST Algorithms for the Lovasz Local Lemma
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
Improved Distributed Lower Bounds for MIS and Bounded (Out-)Degree Dominating Sets in Trees
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
44
18
0
04 Jun 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
61
24
0
03 Jun 2021
Distributed Graph Coloring Made Easy
Distributed Graph Coloring Made Easy
Yannic Maus
56
25
0
12 May 2021
Locally Checkable Labelings with Small Messages
Locally Checkable Labelings with Small Messages
Alkida Balliu
K. Censor-Hillel
Yannic Maus
Dennis Olivetti
Jukka Suomela
47
16
0
12 May 2021
The randomized local computation complexity of the Lovász local lemma
The randomized local computation complexity of the Lovász local lemma
S. Brandt
Christoph Grunau
Václav Rozhon
51
10
0
30 Mar 2021
Locally Checkable Problems in Rooted Trees
Locally Checkable Problems in Rooted Trees
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Jan Studený
Jukka Suomela
A. Tereshchenko
73
28
0
18 Feb 2021
Probabilistic constructions in continuous combinatorics and a bridge to
  distributed algorithms
Probabilistic constructions in continuous combinatorics and a bridge to distributed algorithms
Anton Bernshteyn
59
17
0
17 Feb 2021
Local Mending
Local Mending
Alkida Balliu
J. Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
LRM
73
9
0
17 Feb 2021
The Complexity Landscape of Distributed Locally Checkable Problems on
  Trees
The Complexity Landscape of Distributed Locally Checkable Problems on Trees
Yi-Jun Chang
LRM
46
31
0
21 Sep 2020
Generalizing the Sharp Threshold Phenomenon for the Distributed
  Complexity of the Lovász Local Lemma
Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
S. Brandt
Christoph Grunau
Václav Rozhon
52
11
0
08 Jun 2020
Distributed Lower Bounds for Ruling Sets
Distributed Lower Bounds for Ruling Sets
Alkida Balliu
S. Brandt
Dennis Olivetti
52
41
0
17 Apr 2020
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
Distributed Edge Coloring in Time Quasi-Polylogarithmic in Delta
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
51
12
0
25 Feb 2020
Truly Tight-in-$Δ$ Bounds for Bipartite Maximal Matching and
  Variants
Truly Tight-in-ΔΔΔ Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
42
26
0
19 Feb 2020
A Breezing Proof of the KMW Bound
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
55
4
0
14 Feb 2020
Classification of distributed binary labeling problems
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
A Sharp Threshold Phenomenon for the Distributed Complexity of the
  Lovász Local Lemma
A Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma
S. Brandt
Yannic Maus
Jara Uitto
52
10
0
17 Aug 2019
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Seeing Far vs. Seeing Wide: Volume Complexity of Local Graph Problems
Will Rosenbaum
Jukka Suomela
53
15
0
18 Jul 2019
A Topological Perspective on Distributed Network Algorithms
A Topological Perspective on Distributed Network Algorithms
Armando Castañeda
Pierre Fraigniaud
A. Paz
S. Rajsbaum
Matthieu Roy
Corentin Travers
49
25
0
08 Jul 2019
On the Use of Randomness in Local Distributed Graph Algorithms
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
On the Complexity of Distributed Splitting Problems
P. Bamberger
M. Ghaffari
Fabian Kuhn
Yannic Maus
Jara Uitto
53
7
0
28 May 2019
Fast Deterministic Algorithms for Highly-Dynamic Networks
Fast Deterministic Algorithms for Highly-Dynamic Networks
K. Censor-Hillel
Neta Dafni
V. I. Kolobov
A. Paz
Gregory Schwartzman
64
5
0
13 Jan 2019
Lower bounds for maximal matchings and maximal independent sets
Lower bounds for maximal matchings and maximal independent sets
Alkida Balliu
S. Brandt
J. Hirvonen
Dennis Olivetti
Mikael Rabie
Jukka Suomela
FedML
57
98
0
08 Jan 2019
On the Power of Preprocessing in Decentralized Network Optimization
On the Power of Preprocessing in Decentralized Network Optimization
Klaus-Tycho Foerster
J. Hirvonen
Stefan Schmid
Jukka Suomela
30
20
0
03 Dec 2018
Hardness of minimal symmetry breaking in distributed computing
Hardness of minimal symmetry breaking in distributed computing
Alkida Balliu
J. Hirvonen
Dennis Olivetti
Jukka Suomela
66
32
0
05 Nov 2018
Distributed coloring of graphs with an optimal number of colors
Distributed coloring of graphs with an optimal number of colors
Étienne Bamas
Louis Esperet
129
9
0
21 Sep 2018
Dynamic Sampling from Graphical Models
Dynamic Sampling from Graphical Models
Weiming Feng
Nisheeth K. Vishnoi
Yitong Yin
10
15
0
17 Jul 2018
Almost Global Problems in the LOCAL Model
Almost Global Problems in the LOCAL Model
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
52
44
0
12 May 2018
Improved Distributed $Δ$-Coloring
Improved Distributed ΔΔΔ-Coloring
M. Ghaffari
J. Hirvonen
Fabian Kuhn
Yannic Maus
42
39
0
08 Mar 2018
Distributed Algorithms Made Secure: A Graph Theoretic Approach
Distributed Algorithms Made Secure: A Graph Theoretic Approach
M. Parter
E. Yogev
FedML
53
16
0
04 Dec 2017
On Derandomizing Local Distributed Algorithms
On Derandomizing Local Distributed Algorithms
M. Ghaffari
David G. Harris
Fabian Kuhn
OODFedML
63
137
0
06 Nov 2017
New Classes of Distributed Time Complexity
New Classes of Distributed Time Complexity
Alkida Balliu
J. Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
Dennis Olivetti
Jukka Suomela
46
57
0
06 Nov 2017
Fooling Views: A New Lower Bound Technique for Distributed Computations
  under Congestion
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
83
29
0
05 Nov 2017
The Complexity of Distributed Edge Coloring with Small Palettes
The Complexity of Distributed Edge Coloring with Small Palettes
Yi-Jun Chang
Qizheng He
Wenzheng Li
Seth Pettie
Jara Uitto
127
50
0
14 Aug 2017
Improved Distributed Degree Splitting and Edge Coloring
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
A Time Hierarchy Theorem for the LOCAL Model
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
52
102
0
20 Apr 2017
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
How Long It Takes for an Ordinary Node with an Ordinary ID to Output?
Laurent Feuilloley
51
14
0
19 Apr 2017
LCL problems on grids
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
60
59
0
17 Feb 2017
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
K. Censor-Hillel
M. Parter
Gregory Schwartzman
82
75
0
04 Aug 2016
An Exponential Separation Between Randomized and Deterministic
  Complexity in the LOCAL Model
An Exponential Separation Between Randomized and Deterministic Complexity in the LOCAL Model
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
104
166
0
26 Feb 2016
1