An optimal, purely functional implementation of the Garsia–Wachs algorithm (Q5110926): Difference between revisions

@@ Property / cites work @@
+Algorithm Design with Haskell
@@ Property / cites work: Algorithm Design with Haskell / rank @@
+Normal rank
@@ Property / cites work @@
+A New Algorithm for Minimum Cost Binary Trees
@@ Property / cites work: A New Algorithm for Minimum Cost Binary Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4742310
@@ Property / cites work: Q4742310 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Computer Search Trees and Variable-Length Alphabetical Codes
+Normal rank
@@ Property / cites work @@
+The Zipper
@@ Property / cites work: The Zipper / rank @@
+Normal rank
@@ Property / cites work @@
+Correctness of constructing optimal alphabetic trees revisited
+Normal rank
@@ Property / cites work @@
+A new proof of the Garsia-Wachs algorithm
@@ Property / cites work: A new proof of the Garsia-Wachs algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Optimum binary search trees
@@ Property / cites work: Optimum binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q4349924
@@ Property / cites work: Q4349924 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1017/s0956796819000194
+Normal rank
@@ Property / OpenAlex ID @@
+W3000918834
@@ Property / OpenAlex ID: W3000918834 / rank @@
+Normal rank