Stable Sorting in Asymptotically Optimal Time and Extra Space

DOI10.1145/322063.322064MaRDI QIDQ4148943zbMATH OpenOpenAlexFDO

Authors Edward C. Horvath

Publication date 1978

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

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited in

(6)

• Stable duplicate-key extraction with optimal time and space bounds
• Stable unmerging in linear time and constant space
• Some simple in-place merging algorithms
• Sorting multisets stably in minimum space
• Sorting multisets stably in minimum space
• A note on detecting simple redundancies in linear systems

This page was built for publication: Stable Sorting in Asymptotically Optimal Time and Extra Space

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