Bounds on Optimal Merge Performance, and a Strategy for Optimality
From MaRDI portal
Publication:5677398
DOI10.1145/321724.321729zbMath0261.94021OpenAlexW1971496971MaRDI QIDQ5677398
W. Donald Frazer, B. T. Bennett
Publication date: 1972
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321724.321729
Related Items (2)
Sorting under partial information (without the ellipsoid algorithm). ⋮ On Generalized Comparison-Based Sorting Problems
This page was built for publication: Bounds on Optimal Merge Performance, and a Strategy for Optimality