Significant Improvements to the Hwang-Lin Merging Algorithm

DOI10.1145/322139.322144MaRDI QIDQ4188747zbMATH OpenOpenAlexFDO

Authors Glenn K. Manacher

Publication date 1979

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/322139.322144

zbMATH Keywords

Merging Algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Algorithms in computer science (68W99)

Cited in

(8)

• Significant improvements to the Ford-Johnson algorithm for sorting
• New algorithms for the LCS problem
• Merging of 4 or 5 elements with n elements
• Some modified algorithms for Dijkstra's longest upsequence problem
• An improvement of the binary merge algorithm
• Expected time analysis of interpolation merge -- a simple new merging algorithm
• On partial sorting in restricted rounds
• On the optimality of tape merge of two lists with similar size

This page was built for publication: Significant Improvements to the Hwang-Lin Merging Algorithm

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