The following pages link to (Q3579429):
Displaying 16 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- An approximation algorithm for binary searching in trees (Q633849) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On the diameter of tree associahedra (Q1991427) (← links)
- An efficient noisy binary search in graphs via Median approximation (Q2115863) (← links)
- On the Huffman and alphabetic tree problem with general cost functions (Q2249740) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- Searching a Tree with Permanently Noisy Advice (Q5009618) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- The complexity of bicriteria tree-depth (Q5918682) (← links)
- The complexity of bicriteria tree-depth (Q5925612) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
- Partial order multiway search (Q6535268) (← links)
