Pages that link to "Item:Q633849"

The following pages link to An approximation algorithm for binary searching in trees (Q633849):

Displaying 10 items.

• Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
• The optimal binary search tree for Andersson's search algorithm (Q1323348) (← links)
• The cost of offline binary search tree algorithms and the complexity of the request sequence (Q2481968) (← links)
• Practical approximation algorithms for zero- and bounded-skew trees (Q2768326) (← links)
• On binary searching with nonuniform costs (Q2784491) (← links)
• The Expected Performance of Traversal Algorithms in Binary Trees (Q3685212) (← links)
• A subquadratic algorithm for constructing approximately optimal binary search trees (Q3795240) (← links)
• Efficient search algorithm on compact S-trees (Q4216183) (← links)
• (Q4524567) (← links)
• Partial order multiway search (Q6535268) (← links)