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. 2009.14729
  4. Cited By
Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time
  and Slightly Super-Linear Work

Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work

30 September 2020
Michael Elkin
Shaked Matar
ArXiv (abs)PDFHTML

Papers citing "Deterministic PRAM Approximate Shortest Paths in Polylogarithmic Time and Slightly Super-Linear Work"

1 / 1 papers shown
Title
Undirected $(1+\varepsilon)$-Shortest Paths via Minor-Aggregates:
  Near-Optimal Deterministic Parallel & Distributed Algorithms
Undirected (1+ε)(1+\varepsilon)(1+ε)-Shortest Paths via Minor-Aggregates: Near-Optimal Deterministic Parallel & Distributed Algorithms
Václav Rozhon
Christoph Grunau
Bernhard Haeupler
Goran Zuzic
Jason Li
58
29
0
12 Apr 2022
1