Time-work tradeoffs for parallel algorithms

DOI10.1145/265910.265923zbMath0891.68049OpenAlexW1986816824MaRDI QIDQ4377595

Thomas H. Spencer

Publication date: 17 February 1998

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1997-44/

zbMATH Keywords

shortest pathbreadth-first searchEREW PRAM model

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Related Items (2)

Nearly Work-Efficient Parallel Algorithm for Digraph Reachability ⋮ Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models

This page was built for publication: Time-work tradeoffs for parallel algorithms