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"

16 / 66 papers shown
Title
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
Smaller Cuts, Higher Lower Bounds
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
59
29
0
07 Jan 2019
The distributed complexity of locally checkable problems on paths is
  decidable
The distributed complexity of locally checkable problems on paths is decidable
Alkida Balliu
S. Brandt
Yi-Jun Chang
Dennis Olivetti
Mikael Rabie
Jukka Suomela
28
30
0
05 Nov 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
68
32
0
05 Nov 2018
Quantum Advantage for the LOCAL Model in Distributed Computing
Quantum Advantage for the LOCAL Model in Distributed Computing
F. Gall
H. Nishimura
A. Rosmanis
LRM
28
32
0
25 Oct 2018
Almost Global Problems in the LOCAL Model
Almost Global Problems in the LOCAL Model
Alkida Balliu
S. Brandt
Dennis Olivetti
Jukka Suomela
56
44
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
62
16
0
04 Dec 2017
On Derandomizing Local Distributed Algorithms
On Derandomizing Local Distributed Algorithms
M. Ghaffari
David G. Harris
Fabian Kuhn
OODFedML
72
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
49
57
0
06 Nov 2017
An Optimal Distributed $(Δ+1)$-Coloring Algorithm?
An Optimal Distributed (Δ+1)(Δ+1)(Δ+1)-Coloring Algorithm?
Yi-Jun Chang
Wenzheng Li
Seth Pettie
OOD
70
81
0
03 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
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
75
55
0
16 May 2017
Constant Space and Non-Constant Time in Distributed Computing
Constant Space and Non-Constant Time in Distributed Computing
Tuomo Lempiäinen
Jukka Suomela
46
0
0
10 May 2017
Towards a complexity theory for the congested clique
Towards a complexity theory for the congested clique
Janne H. Korhonen
Jukka Suomela
52
43
0
09 May 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
65
59
0
17 Feb 2017
Distributed $(Δ+1)$-Coloring in Sublogarithmic Rounds
Distributed (Δ+1)(Δ+1)(Δ+1)-Coloring in Sublogarithmic Rounds
David G. Harris
Johannes Schneider
Hsin-Hao Su
OOD
60
11
0
04 Mar 2016
Previous
12