Fast integer sorting in linear space

DOI10.1007/3-540-46541-3_20MaRDI QIDQ2728853zbMATH OpenFDO

Authors Yijie Han

Publication date 1 November 2001

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

Full work available at URL https://doi.org/10.1007/3-540-46541-3_20

zbMATH Keywords

fast deterministic algorithminteger sortinglinear spacenonconservative sortingparallel sorting

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99) Nonnumerical algorithms (68W05)

Recommendations

• Improved fast integer sorting in linear space
• scientific article; zbMATH DE number 1263219
• Improved fast integer sorting in linear space
• scientific article; zbMATH DE number 742994
• Deterministic sorting in O(nloglogn) time and linear space

Cited in

(7)

• Sorting numbers in linear expected time and optimal extra space
• Sorting in linear time?
• Improved fast integer sorting in linear space
• Improved fast integer sorting in linear space
• Expected linear time sorting for word size \(\Omega (\log ^{2} n \log\log n)\)
• Deterministic sorting in O(nloglogn) time and linear space
• Conservative algorithms for parallel and sequential integer sorting

This page was built for publication: Fast integer sorting in linear space

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