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. 1903.05956
  4. Cited By
Fast Approximate Shortest Paths in the Congested Clique
v1v2 (latest)

Fast Approximate Shortest Paths in the Congested Clique

14 March 2019
K. Censor-Hillel
Michal Dory
Janne H. Korhonen
Dean Leitersdorf
ArXiv (abs)PDFHTML

Papers citing "Fast Approximate Shortest Paths in the Congested Clique"

14 / 14 papers shown
Title
Improved All-Pairs Approximate Shortest Paths in Congested Clique
Improved All-Pairs Approximate Shortest Paths in Congested Clique
Hong Duc Bui
Shashwat Chandra
Yi-Jun Chang
Michal Dory
Dean Leitersdorf
94
3
0
04 May 2024
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Fully Scalable Massively Parallel Algorithms for Embedded Planar Graphs
Yi-Jun Chang
Danling Zheng
94
1
0
15 Apr 2023
Fault-Tolerant Graph Realizations in the Congested Clique
Fault-Tolerant Graph Realizations in the Congested Clique
A. R. Molla
Manish Kumar
S. Sivasubramaniam
31
1
0
22 Aug 2022
Distributed Subgraph Finding: Progress and Challenges
Distributed Subgraph Finding: Progress and Challenges
K. Censor-Hillel
65
14
0
13 Mar 2022
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
Fast Distributed Algorithms for Girth, Cycles and Small Subgraphs
K. Censor-Hillel
Orr Fischer
T. Gonen
F. Gall
Dean Leitersdorf
R. Oshman
144
28
0
19 Jan 2021
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
90
13
0
10 Nov 2020
Computing Shortest Paths and Diameter in the Hybrid Network Model
Computing Shortest Paths and Diameter in the Hybrid Network Model
Fabian Kuhn
P. Schneider
106
30
0
15 Jun 2020
Input-Dynamic Distributed Algorithms for Communication Networks
Input-Dynamic Distributed Algorithms for Communication Networks
Klaus-Tycho Foerster
Janne H. Korhonen
A. Paz
Joel Rybicki
Stefan Schmid
71
3
0
15 May 2020
Exponentially Faster Shortest Paths in the Congested Clique
Exponentially Faster Shortest Paths in the Congested Clique
Michal Dory
M. Parter
136
23
0
06 Mar 2020
Massively Parallel Algorithms for Distance Approximation and Spanners
Massively Parallel Algorithms for Distance Approximation and Spanners
Amartya Shankha Biswas
Michal Dory
M. Ghaffari
Slobodan Mitrović
Yasamin Nazari
97
20
0
02 Mar 2020
Sparse Hopsets in Congested Clique
Sparse Hopsets in Congested Clique
Yasamin Nazari
45
1
0
17 Nov 2019
Distributed MST: A Smoothed Analysis
Distributed MST: A Smoothed Analysis
Soumyottam Chatterjee
Gopal Pandurangan
N. Pham
64
10
0
06 Nov 2019
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Parallel Approximate Undirected Shortest Paths Via Low Hop Emulators
Alexandr Andoni
C. Stein
Peilin Zhong
58
56
0
05 Nov 2019
Shortest Paths in a Hybrid Network Model
Shortest Paths in a Hybrid Network Model
John E. Augustine
Kristian Hinnenthal
Fabian Kuhn
Christian Scheideler
P. Schneider
60
31
0
04 Sep 2019
1