Parallelism in tape-sorting

DOI10.1145/360924.360941MaRDI QIDQ4401566zbMATH OpenOpenAlexFDO

Authors Shimon Even

Publication date 1974

Published in Communications of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/360924.360941

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Recommendations

• Sorting in Parallel
• Parallel sorting revisited
• Parallel Sorting with Serial Memories
• Parallel complexity of sorting problems
• The Complexity of Parallel Sorting
• Parallel bimonotonic sorting
• scientific article; zbMATH DE number 4074508
• scientific article; zbMATH DE number 3938577
• Sorting roughly sorted sequences in parallel

Cited in

(6)

• Noisy sort, a memory-intensive sorting algorithm
• scientific article; zbMATH DE number 1639653 (Why is no real title available?)
• Parallel distributive partitioned sorting methods
• External parallel sorting with multiprocessor computers
• Reordering for parallelism
• Slowing down sorting networks to obtain faster sorting algorithms

This page was built for publication: Parallelism in tape-sorting

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