Sorting in Parallel

DOI10.2307/2589078zbMATH Open0912.68023OpenAlexW4234998299MaRDI QIDQ4221602FDOQ4221602

Authors: Ran Libeskind-Hadas 

Publication date: 3 January 1999

Full work available at URL: https://doi.org/10.2307/2589078

Recommendations

• scientific article; zbMATH DE number 4074508
• scientific article; zbMATH DE number 4070343
• Parallel sorting revisited
• Parallel complexity of sorting problems
• Parallel sorting by regular sampling

zbMATH Keywords

parallel computing

Mathematics Subject Classification ID

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

Cited In (10)

• Slowing down sorting networks to obtain faster sorting algorithms
• Title not available (Why is that?)
• Parallel complexity of sorting problems
• Distributed sorting
• Parallelism in tape-sorting
• Reordering for parallelism
• Parallel Sorting with Serial Memories
• Conway's parallel sorting algorithm
• Sorting on a ring of processors
• A parallel sorting scheme whose basic operation sortsN elements

This page was built for publication: Sorting in Parallel

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