Correction: Parallel Merge Sort

DOI10.1137/0222081MaRDI QIDQ4277548zbMATH OpenOpenAlexFDO

Authors Richard Cole

Publication date 24 February 1994

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0222081

zbMATH Keywords

CREW PRAMEREW PRAMmerge sortparallel algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cited in

(8)

• An efficient parallel algorithm for random sampling
• The bulk-synchronous parallel random access machine
• Usefulness of the Karp-Miller-Rosenberg algorithm in parallel computations on strings and arrays
• On parallel complexity of the subgraph homeomorphism of the subgraph isomorphism problem for classes of planar graphs
• Two-coloring linked lists is NC\(^ 1\)-complete for logarithmic space
• A Pictorial Description of Cole’s Parallel Merge Sort
• Recursive merge sort with erroneous comparisons
• Parallel construction of minimal suffix and factor automata

This page was built for publication: Correction: Parallel Merge Sort

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