An optimal, purely functional implementation of the Garsia–Wachs algorithm

DOI10.1017/S0956796819000194zbMath1442.68284OpenAlexW3000918834WikidataQ126317492 ScholiaQ126317492MaRDI QIDQ5110926

Richard S. Bird

Publication date: 26 May 2020

Published in: Journal of Functional Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0956796819000194

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Functional programming and lambda calculus (68N18)

Cites Work

• Correctness of constructing optimal alphabetic trees revisited
• Optimum binary search trees
• Algorithm Design with Haskell
• A new proof of the Garsia-Wachs algorithm
• A New Algorithm for Minimum Cost Binary Trees
• The Zipper
• Optimal Computer Search Trees and Variable-Length Alphabetical Codes
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal, purely functional implementation of the Garsia–Wachs algorithm