Pages that link to "Item:Q650925"
From MaRDI portal
The following pages link to On the complexity of searching in trees and partially ordered structures (Q650925):
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)
- The query complexity of order-finding (Q596296) (← links)
- Partial-order analogue of the secretary problem: The binary tree case (Q1584204) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- The binary identification problem for weighted trees (Q1758172) (← links)
- On Dasgupta's hierarchical clustering objective and its relation to other graph parameters (Q2140508) (← links)
- Searching in Trees, Series-Parallel and Interval Orders (Q3756532) (← links)
- (Q4782721) (← links)
- (Q4817726) (← links)
- On the existence of special depth first search trees (Q4842707) (← links)
- Searching for quicksand ideals in partially ordered sets (Q4990125) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- Competitive Online Search Trees on Trees (Q6051990) (← links)
- Theoretical Analysis of Git Bisect (Q6492083) (← links)
- Partial order multiway search (Q6535268) (← links)