On the Optimality of Linear Merge

DOI10.1137/0209006MaRDI QIDQ3891786zbMATH OpenOpenAlexFDO

Authors Paul K. Stockmeyer, F. Frances Yao

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

zbMATH Keywords

linear merging algorithmlinearly ordered listspaired comparisons

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Cited in

(5)

• Efficient algorithms for merging
• An improvement of the binary merge algorithm
• On the optimality of tape merge of two lists with similar size
• Asymptotically efficient in-place merging
• The Ford-Johnson algorithm still unbeaten for less than 47 elements

This page was built for publication: On the Optimality of Linear Merge

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