Conservative algorithms for parallel and sequential integer sorting

DOI10.1007/BFB0030847MaRDI QIDQ6085719zbMATH OpenOpenAlexFDO

Authors Yijie Han, Xiaojun Shen

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0030847

zbMATH Keywords

analysis of algorithmsparallel algorithmsdesign of algorithmsinteger sortingbucket sortingconservative algorithms

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Searching and sorting (68P10) Parallel algorithms in computer science (68W10)

Recommendations

• Improved nonconservative sequential and parallel integer sorting
• scientific article; zbMATH DE number 88973
• Improved deterministic parallel integer sorting
• scientific article; zbMATH DE number 1629826
• scientific article; zbMATH DE number 742994

Cites work

• scientific article; zbMATH DE number 4215352 (Why is no real title available?)
• scientific article; zbMATH DE number 742994 (Why is no real title available?)
• A Parallel Algorithm for the Efficient Solution of a General Class of Recurrence Equations
• Deterministic parallel list ranking
• Improved deterministic parallel integer sorting
• Improved nonconservative sequential and parallel integer sorting
• New Parallel-Sorting Schemes
• On parallel integer sorting
• Optimal and Sublogarithmic Time Randomized Parallel Sorting Algorithms
• Parallel Prefix Computation
• Parallelism in Comparison Problems
• Towards optimal parallel bucket sorting
• Upper bounds for sorting integers on random access machines

Cited in

(1)

• A Linear Time Algorithm for Ordered Partition

This page was built for publication: Conservative algorithms for parallel and sequential integer sorting

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