Ultrafast Expected Time Parallel Algorithms

DOI10.1006/JAGM.1997.0892MaRDI QIDQ4377119zbMATH OpenOpenAlexFDO

Authors Q. F. Stout, Philip MacKenzie

Publication date 9 February 1998

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.1997.0892

zbMATH Keywords

CRCW PRAM algorithmpadded sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Distributed algorithms (68W15)

Recommendations

• scientific article; zbMATH DE number 1256701
• Improved deterministic parallel integer sorting
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Probabilistic Parallel Algorithms for Sorting and Selection

Cited in

(3)

• New sequential and parallel algorithms for computing the \(\beta\)-spectrum
• The projector algorithm: a simple parallel algorithm for computing Voronoi diagrams and Delaunay graphs
• A parallel batch-dynamic data structure for the closest pair problem

This page was built for publication: Ultrafast Expected Time Parallel Algorithms

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