Simplified stable merging tasks
- 1 December 1987
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 8 (4) , 557-571
- https://doi.org/10.1016/0196-6774(87)90050-2
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The un-merging problemACM SIGACT News, 1985
- A simple linear-time algorithm for in situ mergingInformation Processing Letters, 1984
- Some simple in-place merging algorithmsBIT Numerical Mathematics, 1981
- On a stable minimum storage merging algorithmInformation Processing Letters, 1981
- Stable Sorting in Asymptotically Optimal Time and Extra SpaceJournal of the ACM, 1978
- Stable Sorting and Merging with Optimal Space and Time BoundsSIAM Journal on Computing, 1977
- A fast stable sorting algorithm with absolutely minimum storageTheoretical Computer Science, 1975
- A stable minimum storage sorting algorithmInformation Processing Letters, 1974