Correction: Parallel Merge Sort

DOI10.1137/0222081zbMath0799.68055OpenAlexW2058330097MaRDI QIDQ4277548

Richard John 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

parallel algorithmCREW PRAMEREW PRAMmerge sort

Mathematics Subject Classification ID

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

Related Items (6)

An efficient parallel algorithm for random sampling ⋮ The bulk-synchronous parallel random access machine ⋮ Parallel construction of minimal suffix and factor automata ⋮ 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

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