A new proof of the Garsia-Wachs algorithm

DOI10.1016/0196-6774(88)90009-0MaRDI QIDQ3774966zbMATH OpenOpenAlexFDO

Authors Jeffrey H. Kingston

Publication date 1988

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(88)90009-0

zbMATH Keywords

Garsia-Wachs algorithmminimum cost binary trees

Mathematics Subject Classification ID

Searching and sorting (68P10) Analysis of algorithms and problem complexity (68Q25) Search theory (90B40)

Recommendations

• Leverrier’s Algorithm: A New Proof and Extensions
• A new proof of Wojcicka's conjecture
• A new algorithm for the Quillen-Suslin theorem
• scientific article; zbMATH DE number 64156
• A new proof of the Gerritzen-Grauert theorem
• A new proof of Gumm's theorem
• scientific article; zbMATH DE number 3994420
• scientific article; zbMATH DE number 3015970
• scientific article; zbMATH DE number 3016176

Cited in

(10)

• Correctness of constructing optimal alphabetic trees revisited
• Operations research applications of dichotomous search
• A new algorithm for the Quillen-Suslin theorem
• A novel proof of the Souriau-Frame-Faddeev algorithm
• An optimal, purely functional implementation of the Garsia-Wachs algorithm
• A New Proof of the T-C Algorithm
• Optimal binary search trees
• Guthrie's problem: new equivalences and rapid reductions
• Old and new results on alphabetic codes
• Two blossoming proofs of the Lane-Riesenfeld algorithm

This page was built for publication: A new proof of the Garsia-Wachs algorithm

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