A strategy for searching with different access costs. (Q1853499): Difference between revisions

@@ Property / cites work @@
+On binary search trees
@@ Property / cites work: On binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Search in an Ordered Array Having Variable Probe Cost
+Normal rank
@@ Property / cites work @@
+Optimum binary search trees
@@ Property / cites work: Optimum binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+A subquadratic algorithm for constructing approximately optimal binary search trees
+Normal rank
@@ Property / cites work @@
+Minimum average cost testing for partially ordered components
+Normal rank
@@ Property / cites work @@
+Nearly optimal binary search trees
@@ Property / cites work: Nearly 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 @@
+On an efficient dynamic programming technique of F. F. Yao
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(01)00262-6
+Normal rank
@@ Property / OpenAlex ID @@
+W2032297021
@@ Property / OpenAlex ID: W2032297021 / rank @@
+Normal rank