Stable Sorting and Merging with Optimal Space and Time Bounds
From MaRDI portal
Publication:4128003
DOI10.1137/0206025zbMath0356.68054OpenAlexW1994772453MaRDI QIDQ4128003
Publication date: 1977
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0206025
Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)
Related Items (11)
A generalized, one-way, stackless quicksort ⋮ Line-segment intersection made in-place ⋮ Stable duplicate-key extraction with optimal time and space bounds ⋮ Stable unmerging in linear time and constant space ⋮ Optimizing stable in-place merging. ⋮ On a stable minimum storage merging algorithm ⋮ Some simple in-place merging algorithms ⋮ Stable in situ sorting and minimum data movement ⋮ Stable set and multiset operations in optimal time and space ⋮ Asymptotically efficient in-place merging ⋮ An efficient external sorting with minimal space requirement
This page was built for publication: Stable Sorting and Merging with Optimal Space and Time Bounds
