Improved nonconservative sequential and parallel integer sorting

DOI10.1016/0020-0190(90)90097-HzbMath0704.68028OpenAlexW2016924854MaRDI QIDQ917274

Torben Hagerup, Hong Shen

Publication date: 1990

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90097-h

zbMATH Keywords

word lengthnonconservative algorithmsparallel integer sortingunit-cost EREW PRAMunit-cost measureunit-cost RAM

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)

Related Items (8)

Improved parallel integer sorting without concurrent writing ⋮ Conservative algorithms for parallel and sequential integer sorting ⋮ Fast sequential and parallel algorithms for finding extremal sets ⋮ Breadth-first traversal of trees and integer sorting in parallel ⋮ A parallel algorithm for edge-coloring of graphs with edge-disjoint cycles ⋮ Sorting in linear time? ⋮ Improved fast integer sorting in linear space ⋮ OptORAMa: optimal oblivious RAM

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds for sorting integers on random access machines
• On parallel integer sorting
• Improved deterministic parallel integer sorting
• Deterministic coin tossing with applications to optimal parallel list ranking

This page was built for publication: Improved nonconservative sequential and parallel integer sorting