Time-work tradeoffs for parallel algorithms

DOI10.1145/265910.265923MaRDI QIDQ4377595zbMATH OpenOpenAlexFDO

Authors 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

breadth-first searchEREW PRAM modelshortest path

Mathematics Subject Classification ID

Distributed algorithms (68W15)

Recommendations

• Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
• scientific article; zbMATH DE number 4068310
• Fast parallel graph searching with applications
• Efficient parallel algorithms for path problems in directed graphs

Cited in

(11)

• High-Probability Parallel Transitive-Closure Algorithms
• scientific article; zbMATH DE number 5005293 (Why is no real title available?)
• Trade-Offs between Depth and Width in Parallel Computation
• Time-memory-processor trade-offs
• Time–Work Tradeoffs of the Single-Source Shortest Paths Problem
• scientific article; zbMATH DE number 1535432 (Why is no real title available?)
• scientific article; zbMATH DE number 2172786 (Why is no real title available?)
• scientific article; zbMATH DE number 822186 (Why is no real title available?)
• Near-Optimal Approximate Shortest Paths and Transshipment in Distributed and Streaming Models
• Nearly work-efficient parallel algorithm for digraph reachability
• scientific article; zbMATH DE number 4187099 (Why is no real title available?)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377595)