Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1011.5470
Cited By
v1
v2 (latest)
Local Computation: Lower and Upper Bounds
24 November 2010
Fabian Kuhn
Thomas Moscibroda
Roger Wattenhofer
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Local Computation: Lower and Upper Bounds"
43 / 43 papers shown
Title
Distributed MIS with Low Energy and Time Complexities
M. Ghaffari
Julian Portmann
44
10
0
19 May 2023
Distributed Maximal Matching and Maximal Independent Set on Hypergraphs
Alkida Balliu
S. Brandt
Fabian Kuhn
Dennis Olivetti
62
8
0
03 Nov 2022
Distributed distance domination in graphs with no
K
2
,
t
K_{2,t}
K
2
,
t
-minor
A. Czygrinow
Michal Hanćkowiak
Marcin Witkowski
45
1
0
07 Mar 2022
Local planar domination revisited
O. Heydt
S. Siebertz
Alexandre Vigny
61
5
0
29 Nov 2021
Time-Optimal Sublinear Algorithms for Matching and Vertex Cover
Soheil Behnezhad
29
32
0
05 Jun 2021
Distributed Graph Coloring Made Easy
Yannic Maus
56
25
0
12 May 2021
Improving Multi-agent Coordination by Learning to Estimate Contention
Panayiotis Danassis
Florian Wiedemair
Boi Faltings
37
3
0
09 May 2021
On Distributed Algorithms for Minimum Dominating Set problem, from theory to application
Sharareh Alipour
Ehsan Futuhi
Shayan Karimi
45
12
0
09 Dec 2020
Sleeping is Efficient: MIS in
O
(
1
)
O(1)
O
(
1
)
-rounds Node-averaged Awake Complexity
Soumyottam Chatterjee
R. Gmyr
Gopal Pandurangan
57
34
0
12 Jun 2020
Distributed Lower Bounds for Ruling Sets
Alkida Balliu
S. Brandt
Dennis Olivetti
42
41
0
17 Apr 2020
On Local Computation for Optimization in Multi-Agent Systems
Robin Brown
Federico Rossi
Kiril Solovey
Michael T. Wolf
Marco Pavone
11
0
0
27 Feb 2020
Improved MPC Algorithms for MIS, Matching, and Coloring on Trees and Beyond
M. Ghaffari
Christoph Grunau
Ce Jin
49
30
0
22 Feb 2020
Truly Tight-in-
Δ
Δ
Δ
Bounds for Bipartite Maximal Matching and Variants
S. Brandt
Dennis Olivetti
37
26
0
19 Feb 2020
A Breezing Proof of the KMW Bound
Corinna Coupette
Christoph Lenzen
53
4
0
14 Feb 2020
Distributed Distance-
r
r
r
Dominating Set on Sparse High-Girth Graphs
S. A. Amiri
Ben Wiederhake
22
0
0
07 Oct 2019
Polylogarithmic-Time Deterministic Network Decomposition and Distributed Derandomization
Václav Rozhon
M. Ghaffari
OOD
51
196
0
25 Jul 2019
Deterministic Distributed Dominating Set Approximation in the CONGEST Model
Janosch Deurer
Fabian Kuhn
Yannic Maus
45
26
0
26 May 2019
Hardness of Distributed Optimization
Nir Bachrach
K. Censor-Hillel
Michal Dory
Yuval Efron
Dean Leitersdorf
A. Paz
56
41
0
24 May 2019
Fast Distributed Algorithms for LP-Type Problems of Bounded Dimension
Kristian Hinnenthal
Christian Scheideler
Martijn Struijs
47
1
0
24 Apr 2019
Optimal Distributed Covering Algorithms
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
33
13
0
25 Feb 2019
Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior
Panayiotis Danassis
Aris Filos-Ratsikas
Boi Faltings
31
13
0
25 Feb 2019
Lower bounds for maximal matchings and maximal independent sets
Alkida Balliu
S. Brandt
J. Hirvonen
Dennis Olivetti
Mikael Rabie
Jukka Suomela
FedML
55
98
0
08 Jan 2019
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
54
29
0
07 Jan 2019
Optimal Distributed Weighted Set Cover Approximation
Ran Ben-Basat
G. Even
Ken-ichi Kawarabayashi
Gregory Schwartzman
26
1
0
17 Aug 2018
Sparsifying Distributed Algorithms with Ramifications in Massively Parallel Computation and Centralized Local Computation
M. Ghaffari
Jara Uitto
58
103
0
17 Jul 2018
Parameterized Distributed Algorithms
Ran Ben-Basat
Ken-ichi Kawarabayashi
Gregory Schwartzman
48
14
0
13 Jul 2018
Distributed Approximation of Minimum
k
k
k
-edge-connected Spanning Subgraphs
Michal Dory
53
16
0
20 May 2018
Distributed Spanner Approximation
K. Censor-Hillel
Michal Dory
64
25
0
09 Feb 2018
New Classes of Distributed Time Complexity
Alkida Balliu
J. Hirvonen
Janne H. Korhonen
Tuomo Lempiäinen
Dennis Olivetti
Jukka Suomela
39
57
0
06 Nov 2017
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
An Optimal Distributed
(
Δ
+
1
)
(Δ+1)
(
Δ
+
1
)
-Coloring Algorithm?
Yi-Jun Chang
Wenzheng Li
Seth Pettie
OOD
58
81
0
03 Nov 2017
Distributed Dominating Set Approximations beyond Planar Graphs
S. A. Amiri
Stefan Schmid
S. Siebertz
43
27
0
25 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
75
55
0
16 May 2017
A Time Hierarchy Theorem for the LOCAL Model
Yi-Jun Chang
Seth Pettie
50
102
0
20 Apr 2017
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
55
59
0
17 Feb 2017
Distributed Domination on Graph Classes of Bounded Expansion
S. A. Amiri
P. D. Mendez
Roman Rabinovich
S. Siebertz
GNN
45
22
0
09 Feb 2017
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
Yi-Jun Chang
T. Kopelowitz
Seth Pettie
96
166
0
26 Feb 2016
A Distributed
(
2
+
ε
)
(2+ε)
(
2
+
ε
)
-Approximation for Vertex Cover in
O
(
log
Δ
/
ε
log
log
Δ
)
O(\logΔ/ε\log\logΔ)
O
(
lo
g
Δ/
ε
lo
g
lo
g
Δ
)
Rounds
R. Bar-Yehuda
K. Censor-Hillel
Gregory Schwartzman
51
5
0
11 Feb 2016
A local constant factor approximation for the minimum dominating set problem on bounded genus graphs
S. A. Amiri
Stefan Schmid
S. Siebertz
43
0
0
09 Feb 2016
A Lower Bound for the Distributed Lovász Local Lemma
S. Brandt
Orr Fischer
J. Hirvonen
Barbara Keller
Tuomo Lempiäinen
Joel Rybicki
Jukka Suomela
Jara Uitto
54
133
0
03 Nov 2015
Thinking Like a Vertex: a Survey of Vertex-Centric Frameworks for Distributed Graph Processing
Ryan McCune
Tim Weninger
G. Madey
48
165
0
15 Jul 2015
Can Quantum Communication Speed Up Distributed Computation?
Michael Elkin
H. Klauck
Danupon Nanongkai
Gopal Pandurangan
116
50
0
22 Jul 2012
1