On the Optimality of Linear Merge
From MaRDI portal
Publication:3891786
DOI10.1137/0209006zbMath0446.68059OpenAlexW1978676087MaRDI QIDQ3891786
F. Frances Yao, Paul K. Stockmeyer
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209006
Related Items (5)
The Ford-Johnson algorithm still unbeaten for less than 47 elements ⋮ On the optimality of tape merge of two lists with similar size ⋮ An improvement of the binary merge algorithm ⋮ Asymptotically efficient in-place merging ⋮ Efficient algorithms for merging
This page was built for publication: On the Optimality of Linear Merge