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. 1704.06297
  4. Cited By
A Time Hierarchy Theorem for the LOCAL Model

A Time Hierarchy Theorem for the LOCAL Model

20 April 2017
Yi-Jun Chang
Seth Pettie
ArXiv (abs)PDFHTML

Papers citing "A Time Hierarchy Theorem for the LOCAL Model"

50 / 66 papers shown
Title
Distributed Quantum Advantage for Local Problems
Distributed Quantum Advantage for Local Problems
Alkida Balliu
S. Brandt
Xavier Coiteux-Roy
Francesco d’Amore
Massimo Equi
...
Dennis Olivetti
M. Renou
Jukka Suomela
Lucas Tendick
Isadora Veeren
36
5
0
05 Nov 2024
Shared Randomness Helps with Local Distributed Problems
Shared Randomness Helps with Local Distributed Problems
Alkida Balliu
Mohsen Ghaffari
Fabian Kuhn
Augusto Modanese
Dennis Olivetti
Mikael Rabie
Jukka Suomela
Jara Uitto
69
4
0
07 Jul 2024
Distributed Delta-Coloring under Bandwidth Limitations
Distributed Delta-Coloring under Bandwidth Limitations
Yannic Maus
Magnús M. Halldórsson
70
5
0
16 May 2024
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
Local Advice and Local Decompression
Local Advice and Local Decompression
Alkida Balliu
Sebastian Brandt
Fabian Kuhn
Krzysztof Nowicki
Dennis Olivetti
Eva Rotenberg
Jukka Suomela
61
1
0
07 May 2024
Polylog-Competitive Deterministic Local Routing and Scheduling
Polylog-Competitive Deterministic Local Routing and Scheduling
Bernhard Haeupler
Shyamal Patel
Antti Roeyskoe
Cliff Stein
Goran Zuzic
61
1
0
12 Mar 2024
Distributed Binary Labeling Problems in High-Degree Graphs
Distributed Binary Labeling Problems in High-Degree Graphs
Henrik Lievonen
Timothé Picavet
Jukka Suomela
68
2
0
19 Dec 2023
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
A Tight Lower Bound for 3-Coloring Grids in the Online-LOCAL Model
Yi-Jun Chang
Gopinath Mishra
Hung Thuan Nguyen
Mingyang Yang
Yu-Cheng Yeh
62
2
0
03 Dec 2023
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
76
2
0
12 Nov 2023
Borel versions of the Local Lemma and LOCAL algorithms for graphs of
  finite asymptotic separation index
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
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
On the Node-Averaged Complexity of Locally Checkable Problems on Trees
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
Gustav Schmid
37
4
0
08 Aug 2023
Conditionally Optimal Parallel Coloring of Forests
Conditionally Optimal Parallel Coloring of Forests
Christoph Grunau
R. Latypov
Yannic Maus
Shreyas Pai
Jara Uitto
60
2
0
01 Aug 2023
No distributed quantum advantage for approximate graph coloring
No distributed quantum advantage for approximate graph coloring
Xavier Coiteux-Roy
Francesco d’Amore
Rishikesh R. Gajjala
Fabian Kuhn
Franccois Le Gall
Henrik Lievonen
Augusto Modanese
M. Renou
Gustav Schmid
Jukka Suomela
74
15
0
18 Jul 2023
Recurrent Problems in the LOCAL model
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
Fast Distributed Brooks' Theorem
Manuela Fischer
Yannic Maus
Magnús M. Halldórsson
OOD
51
17
0
14 Nov 2022
Optimal Deterministic Massively Parallel Connectivity on Forests
Optimal Deterministic Massively Parallel Connectivity on Forests
Alkida Balliu
R. Latypov
Yannic Maus
Dennis Olivetti
Jara Uitto
68
5
0
07 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
Improved Distributed Algorithms for the Lovász Local Lemma and Edge
  Coloring
Improved Distributed Algorithms for the Lovász Local Lemma and Edge Coloring
Peter Davies
67
17
0
18 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
Deterministic Distributed algorithms and Descriptive Combinatorics on
  Δ-regular trees
Deterministic Distributed algorithms and Descriptive Combinatorics on Δ-regular trees
S. Brandt
Yi-Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhon
Zoltán Vidnyánszky
42
1
0
20 Apr 2022
Moser-Tardos Algorithm with small number of random bits
Moser-Tardos Algorithm with small number of random bits
Endre Csóka
L. Grabowski
András Máthé
O. Pikhurko
K. Tyros
38
7
0
11 Mar 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
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
57
20
0
09 Feb 2022
Towards a Complexity Classification of LCL Problems in Massively
  Parallel Computation
Towards a Complexity Classification of LCL Problems in Massively Parallel Computation
S. Brandt
R. Latypov
Jara Uitto
50
0
0
17 Dec 2021
Distributed $Δ$-Coloring Plays Hide-and-Seek
Distributed ΔΔΔ-Coloring Plays Hide-and-Seek
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
65
29
0
01 Oct 2021
Locality in online, dynamic, sequential, and distributed graph
  algorithms
Locality in online, dynamic, sequential, and distributed graph algorithms
Amir Akbari
N. Eslami
Henrik Lievonen
Darya Melnyk
Joona Särkijärvi
Jukka Suomela
60
10
0
14 Sep 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
Local Problems on Trees from the Perspectives of Distributed Algorithms,
  Finitary Factors, and Descriptive Combinatorics
Local Problems on Trees from the Perspectives of Distributed Algorithms, Finitary Factors, and Descriptive Combinatorics
Sebastian Brandt
Yi-Jun Chang
Jan Grebík
Christoph Grunau
Václav Rozhon
Zoltán Vidnyánszky
35
28
0
03 Jun 2021
Coloring Trees in Massively Parallel Computation
Coloring Trees in Massively Parallel Computation
R. Latypov
Jara Uitto
45
1
0
28 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
53
10
0
30 Mar 2021
Classifying Convergence Complexity of Nash Equilibria in Graphical Games
  Using Distributed Computing Theory
Classifying Convergence Complexity of Nash Equilibria in Graphical Games Using Distributed Computing Theory
J. Hirvonen
Laura Schmid
K. Chatterjee
Stefan Schmid
19
0
0
26 Feb 2021
Temporal Locality in Online Algorithms
Temporal Locality in Online Algorithms
Maciej Pacut
Mahmoud Parham
Joel Rybicki
Stefan Schmid
Jukka Suomela
A. Tereshchenko
53
0
0
18 Feb 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
Local Mending
Local Mending
Alkida Balliu
J. Hirvonen
Darya Melnyk
Dennis Olivetti
Joel Rybicki
Jukka Suomela
LRM
74
9
0
17 Feb 2021
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without
  Network Decomposition
Deterministic Distributed Vertex Coloring: Simpler, Faster, and without Network Decomposition
M. Ghaffari
Fabian Kuhn
69
60
0
09 Nov 2020
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 graph problems through an automata-theoretic lens
Distributed graph problems through an automata-theoretic lens
Yi-Jun Chang
Jan Studený
Jukka Suomela
64
20
0
18 Feb 2020
A Breezing Proof of the KMW Bound
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
64
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
53
10
0
17 Aug 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed
  Derandomization
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
Václav Rozhon
M. Ghaffari
OOD
60
196
0
25 Jul 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
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
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators
Broadcast Congested Clique: Planted Cliques and Pseudorandom Generators
Lijie Chen
O. Grossman
51
6
0
19 May 2019
Locality of not-so-weak coloring
Locality of not-so-weak coloring
Alkida Balliu
J. Hirvonen
Christoph Lenzen
Dennis Olivetti
Jukka Suomela
31
12
0
11 Apr 2019
Parameterized Distributed Complexity Theory: A logical approach
Parameterized Distributed Complexity Theory: A logical approach
S. Siebertz
Alexandre Vigny
108
1
0
01 Mar 2019
An Automatic Speedup Theorem for Distributed Problems
An Automatic Speedup Theorem for Distributed Problems
S. Brandt
20
56
0
26 Feb 2019
How much does randomness help with locally checkable problems?
How much does randomness help with locally checkable problems?
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
38
32
0
18 Feb 2019
12
Next