Stable Sorting and Merging with Optimal Space and Time Bounds

DOI10.1137/0206025zbMATH Open0356.68054OpenAlexW1994772453MaRDI QIDQ4128003FDOQ4128003

Authors: Luis Trabb Pardo 

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Cited In (11)

• Stable duplicate-key extraction with optimal time and space bounds
• Asymptotically efficient in-place merging
• Stable unmerging in linear time and constant space
• Optimizing stable in-place merging.
• Stable in situ sorting and minimum data movement
• Line-segment intersection made in-place
• Stable set and multiset operations in optimal time and space
• A generalized, one-way, stackless quicksort
• On a stable minimum storage merging algorithm
• Some simple in-place merging algorithms
• An efficient external sorting with minimal space requirement

This page was built for publication: Stable Sorting and Merging with Optimal Space and Time Bounds

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