STOC 2020

Faster parallel algorithm for approximate shortest path

Conference Paper Session 3A: Distributed and Parallel Algorithms II Algorithms and Complexity · Theoretical Computer Science

Abstract

No abstract is available in the live database for this paper.

Authors

Jason Li 0006

Keywords

No keywords are indexed for this paper.

Context

Venue: ACM Symposium on Theory of Computing
Archive span: 1969-2025
Indexed papers: 4364
Paper id: 279180100629373618