Optimal binary search trees with costs depending on the access paths. (Q1401195): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Computer Search Trees and Variable-Length Alphabetical Codes
+Normal rank
@@ Property / cites work @@
+Optimum binary search trees
@@ Property / cites work: Optimum binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Q5585020
@@ Property / cites work: Q5585020 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768391
@@ Property / cites work: Q2768391 / rank @@
+Normal rank
@@ Property / cites work @@
+A subquadratic algorithm for constructing approximately optimal binary search trees
+Normal rank
@@ Property / cites work @@
+Heuristics for optimum binary search trees and minimum weight triangulation problems
+Normal rank
@@ Property / cites work @@
+Optimal binary search trees
@@ Property / cites work: Optimal binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Binary searching with nonuniform costs and its application to text retrieval
+Normal rank
@@ Property / cites work @@
+Q4855565
@@ Property / cites work: Q4855565 / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(02)00084-1
+Normal rank
@@ Property / OpenAlex ID @@
+W2088407423
@@ Property / OpenAlex ID: W2088407423 / rank @@
+Normal rank