Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1503.04963
Cited By
Algebraic Methods in the Congested Clique
17 March 2015
K. Censor-Hillel
P. Kaski
Janne H. Korhonen
Christoph Lenzen
A. Paz
Jukka Suomela
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Algebraic Methods in the Congested Clique"
25 / 75 papers shown
Title
Distributed Computation in Node-Capacitated Networks
John E. Augustine
M. Ghaffari
R. Gmyr
Kristian Hinnenthal
Fabian Kuhn
Jason Li
Christian Scheideler
13
2
0
18 May 2018
Improved Massively Parallel Computation Algorithms for MIS, Matching, and Vertex Cover
M. Ghaffari
Themis Gouleakis
Christian Konrad
Slobodan Mitrovic
R. Rubinfeld
82
132
0
22 Feb 2018
MIS in the Congested Clique Model in
O
(
log
log
Δ
)
O(\log \log Δ)
O
(
lo
g
lo
g
Δ
)
Rounds
C. Konrad
33
8
0
21 Feb 2018
Distributed Symmetry-Breaking Algorithms for Congested Cliques
Leonid Barenboim
V. Khazanov
36
14
0
20 Feb 2018
Sparse Matrix Multiplication and Triangle Listing in the Congested Clique Model
K. Censor-Hillel
Dean Leitersdorf
Elia Turner
44
34
0
13 Feb 2018
Superlinear Lower Bounds for Distributed Subgraph Detection
Orr Fischer
T. Gonen
R. Oshman
69
1
0
18 Nov 2017
Fooling Views: A New Lower Bound Technique for Distributed Computations under Congestion
Amir Abboud
K. Censor-Hillel
Seri Khoury
Christoph Lenzen
71
29
0
05 Nov 2017
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
58
66
0
03 Nov 2017
Distributed Subgraph Detection
Pierre Fraigniaud
Pedro Montealegre
Dennis Olivetti
I. Rapaport
Ioan Todinca
63
11
0
13 Jun 2017
Graph Reconstruction in the Congested Clique
Pedro Montealegre
Sebastian Perez-Salazar
I. Rapaport
Ioan Todinca
24
5
0
09 Jun 2017
Deterministic subgraph detection in broadcast CONGEST
Janne H. Korhonen
Joel Rybicki
73
52
0
29 May 2017
Triangle Finding and Listing in CONGEST Networks
Taisuke Izumi
F. Gall
54
56
0
25 May 2017
Quadratic and Near-Quadratic Lower Bounds for the CONGEST Model
K. Censor-Hillel
Seri Khoury
A. Paz
70
55
0
16 May 2017
Towards a complexity theory for the congested clique
Janne H. Korhonen
Jukka Suomela
39
43
0
09 May 2017
Super-fast MST Algorithms in the Congested Clique using
o
(
m
)
o(m)
o
(
m
)
Messages
Sriram V. Pemmaraju
Vivek Sardeshmukh
LRM
37
14
0
12 Oct 2016
Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems
F. Gall
41
48
0
09 Aug 2016
Derandomizing Local Distributed Algorithms under Bandwidth Restrictions
K. Censor-Hillel
M. Parter
Gregory Schwartzman
79
75
0
04 Aug 2016
Survey of Distributed Decision
Laurent Feuilloley
Pierre Fraigniaud
82
47
0
14 Jun 2016
Near-Linear Lower Bounds for Distributed Distance Computations, Even in Sparse Networks
Amir Abboud
K. Censor-Hillel
Seri Khoury
43
75
0
17 May 2016
Distributed Testing of Excluded Subgraphs
Pierre Fraigniaud
I. Rapaport
Ville Salo
Ioan Todinca
37
37
0
12 May 2016
On the Distributed Complexity of Large-Scale Graph Computations
Gopal Pandurangan
Peter Robinson
Michele Scquizzato
86
53
0
26 Feb 2016
A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths
Monika Henzinger
Sebastian Krinninger
Danupon Nanongkai
91
112
0
27 Apr 2015
Teaching and compressing for low VC-dimension
Shay Moran
Amir Shpilka
Avi Wigderson
Amir Yehudayoff
74
12
0
22 Feb 2015
Approximation of Distances and Shortest Paths in the Broadcast Congest Clique
S. Holzer
N. Pinsker
67
57
0
10 Dec 2014
Lessons from the Congested Clique Applied to MapReduce
James Hegeman
Sriram V. Pemmaraju
74
86
0
17 May 2014
Previous
1
2