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. 2003.03058
  4. Cited By
Exponentially Faster Shortest Paths in the Congested Clique

Exponentially Faster Shortest Paths in the Congested Clique

6 March 2020
Michal Dory
M. Parter
ArXivPDFHTML

Papers citing "Exponentially Faster Shortest Paths in the Congested Clique"

2 / 2 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
35
2
0
04 May 2024
Distributed Distance Approximation
Distributed Distance Approximation
Bertie Ancona
K. Censor-Hillel
M. Dalirrooyfard
Yuval Efron
Virginia Vassilevska Williams
38
9
0
10 Nov 2020
1