Stable Sorting in Asymptotically Optimal Time and Extra Space

DOI10.1145/322063.322064zbMath0372.68009OpenAlexW2004317014MaRDI QIDQ4148943

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)

Related Items (6)

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

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