An approximation algorithm for binary searching in trees (Q633849): Difference between revisions

@@ Property / author @@
-Eduardo Sany Laber
@@ Property / author: Eduardo Sany Laber / rank @@
-Normal rank
@@ Property / author @@
+Eduardo Sany Laber
@@ Property / author: Eduardo Sany Laber / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-009-9325-0
+Normal rank
@@ Property / OpenAlex ID @@
+W2089672536
@@ Property / OpenAlex ID: W2089672536 / rank @@
+Normal rank
@@ Property / cites work @@
+Protocols for asymmetric communication channels
@@ Property / cites work: Protocols for asymmetric communication channels / rank @@
+Normal rank
@@ Property / cites work @@
+Partial alphabetic trees
@@ Property / cites work: Partial alphabetic trees / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Search in Trees
@@ Property / cites work: Optimal Search in Trees / rank @@
+Normal rank
@@ Property / cites work @@
+Searching in random partially ordered sets
@@ Property / cites work: Searching in random partially ordered sets / rank @@
+Normal rank
@@ Property / cites work @@
+Decision trees for entity identification
@@ Property / cites work: Decision trees for entity identification / rank @@
+Normal rank
@@ Property / cites work @@
+On binary search trees
@@ Property / cites work: On binary search trees / rank @@
+Normal rank
@@ Property / cites work @@
+Near-Entropy Hotlink Assignments
@@ Property / cites work: Near-Entropy Hotlink Assignments / rank @@
+Normal rank
@@ Property / cites work @@
+Q5595624
@@ Property / cites work: Q5595624 / rank @@
+Normal rank
@@ Property / cites work @@
+Huffman coding with unequal letter costs
@@ Property / cites work: Huffman coding with unequal letter costs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3280457
@@ Property / cites work: Q3280457 / rank @@
+Normal rank
@@ Property / cites work @@
+Search in an Ordered Array Having Variable Probe Cost
+Normal rank
@@ Property / cites work @@
+Linear probing and graphs
@@ Property / cites work: Linear probing and graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q3024773
@@ Property / cites work: Q3024773 / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds for asymmetric communication protocols.
+Normal rank
@@ Property / cites work @@
+On the hardness of the minimum height decision tree problem
+Normal rank
@@ Property / cites work @@
+A strategy for searching with different access costs.
+Normal rank
@@ Property / cites work @@
+Q2768391
@@ Property / cites work: Q2768391 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum average cost testing for partially ordered components
+Normal rank
@@ Property / cites work @@
+Q3579429
@@ Property / cites work: Q3579429 / rank @@
+Normal rank
@@ Property / cites work @@
+Binary searching with nonuniform costs and its application to text retrieval
+Normal rank
@@ Property / cites work @@
+Optimal binary search trees with costs depending on the access paths.
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:633849