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
ArXivPDFHTML

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

23 / 23 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
40
2
0
12 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
19
0
0
01 May 2024
The Distributed Complexity of Locally Checkable Labeling Problems Beyond
  Paths and Trees
The Distributed Complexity of Locally Checkable Labeling Problems Beyond Paths and Trees
Yi-Jun Chang
54
1
0
12 Nov 2023
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
29
7
0
03 Nov 2022
Fast Distributed Vertex Splitting with Applications
Fast Distributed Vertex Splitting with Applications
Magnús M. Halldórsson
Yannic Maus
Alexandre Nolin
28
7
0
17 Aug 2022
The Landscape of Distributed Complexities on Trees and Beyond
The Landscape of Distributed Complexities on Trees and Beyond
Christoph Grunau
Václav Rozhon
S. Brandt
25
18
0
09 Feb 2022
Improved Distributed Fractional Coloring Algorithms
Improved Distributed Fractional Coloring Algorithms
Alkida Balliu
Fabian Kuhn
Dennis Olivetti
31
5
0
08 Dec 2021
Component Stability in Low-Space Massively Parallel Computation
Component Stability in Low-Space Massively Parallel Computation
A. Czumaj
Peter Davies
M. Parter
21
22
0
03 Jun 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
20
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
35
24
0
18 Feb 2021
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
21
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
26
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
26
7
0
28 May 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
15
93
0
08 Jan 2019
Distributed coloring of graphs with an optimal number of colors
Distributed coloring of graphs with an optimal number of colors
Étienne Bamas
Louis Esperet
14
9
0
21 Sep 2018
Almost Global Problems in the LOCAL Model
Almost Global Problems in the LOCAL Model
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
19
42
0
12 May 2018
Distributed Algorithms Made Secure: A Graph Theoretic Approach
Distributed Algorithms Made Secure: A Graph Theoretic Approach
M. Parter
E. Yogev
FedML
29
16
0
04 Dec 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
18
24
0
15 Jun 2017
Constant Space and Non-Constant Time in Distributed Computing
Constant Space and Non-Constant Time in Distributed Computing
Tuomo Lempiäinen
Jukka Suomela
19
0
0
10 May 2017
A Time Hierarchy Theorem for the LOCAL Model
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
23
95
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
13
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
30
56
0
17 Feb 2017
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
8
158
0
26 Feb 2016
1