Stable unmerging in linear time and constant space

DOI10.1016/0020-0190(87)90202-XzbMath0653.68053MaRDI QIDQ1108017

Jeffrey S. Salowe, William Steiger

Publication date: 1987

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

zbMATH Keywords

sorted listsspace-time complexity of unmerging

Mathematics Subject Classification ID

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

Related Items (9)

Selecting distances in the plane ⋮ Sorting multisets stably in minimum space ⋮ An in-place algorithm for Klee's measure problem in two dimensions ⋮ In-place algorithms for computing (Layers of) maxima ⋮ Line-segment intersection made in-place ⋮ Stable duplicate-key extraction with optimal time and space bounds ⋮ Stable in situ sorting and minimum data movement ⋮ Stable minimum space partitioning in linear time ⋮ Sorting multisets stably in minimum space

Cites Work

• Stable Sorting and Merging with Optimal Space and Time Bounds
• Stable Sorting in Asymptotically Optimal Time and Extra Space
• Unnamed Item

This page was built for publication: Stable unmerging in linear time and constant space