Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1804.05441
Cited By
A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in
O
~
(
n
3
/
2
)
\tilde{O}(n^{3/2})
O
~
(
n
3/2
)
Rounds
15 April 2018
U. Agarwal
V. Ramachandran
Valerie King
Matteo Pontecorvi
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"A Deterministic Distributed Algorithm for Exact Weighted All-Pairs Shortest Paths in $\tilde{O}(n^{3/2})$ Rounds"
12 / 12 papers shown
Title
Optimizing Graph Transformer Networks with Graph-based Techniques
Loc Hoang
U. Agarwal
G. Gill
Roshan Dathathri
Abhik Seal
Brian Martin
K. Pingali
GNN
46
0
0
16 Jun 2021
Minor Sparsifiers and the Distributed Laplacian Paradigm
S. Forster
Gramoz Goranci
Yang P. Liu
Richard Peng
Xiaorui Sun
Mingquan Ye
62
22
0
31 Dec 2020
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
74
13
0
10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
88
30
0
15 Jun 2020
Faster Deterministic All Pairs Shortest Paths in Congest Model
U. Agarwal
V. Ramachandran
53
23
0
19 May 2020
Shortest Paths in a Hybrid Network Model
John E. Augustine
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
47
31
0
04 Sep 2019
Fast Approximate Shortest Paths in the Congested Clique
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
61
54
0
14 Mar 2019
Smaller Cuts, Higher Lower Bounds
Amir Abboud
K. Censor-Hillel
Seri Khoury
A. Paz
59
29
0
07 Jan 2019
Distributed Exact Weighted All-Pairs Shortest Paths in Near-Linear Time
A. Bernstein
K. Kirchberg
62
53
0
08 Nov 2018
The Sparsest Additive Spanner via Multiple Weighted BFS Trees
Ya-Ping Hsieh
Chen Liu
Volkan Cevher
58
4
0
05 Nov 2018
Distributed Triangle Detection via Expander Decomposition
Yi-Jun Chang
Seth Pettie
Hengjie Zhang
56
47
0
17 Jul 2018
A Faster Distributed Single-Source Shortest Paths Algorithm
Sebastian Krinninger
Danupon Nanongkai
72
66
0
03 Nov 2017
1