The following pages link to Searching ordered structures (Q3700849):
Displayed 17 items.
- On the tree search problem with non-uniform costs (Q306704) (← links)
- Improved approximation algorithms for the average-case tree searching problem (Q476452) (← links)
- Searching in random partially ordered sets (Q596140) (← links)
- On the complexity of searching in trees and partially ordered structures (Q650925) (← links)
- Parallel searching of multidimensional cubes (Q685702) (← links)
- On searching a table consistent with division poset (Q868956) (← links)
- Edge ranking and searching in partial orders (Q955315) (← links)
- Binary search with delayed and missing answers (Q1007537) (← links)
- Every poset has a central element (Q1068859) (← links)
- Binary search in graphs revisited (Q1741841) (← links)
- On the optimality of tape merge of two lists with similar size (Q2182103) (← links)
- Searching monotone multi-dimensional arrays (Q2483400) (← links)
- On the Tree Search Problem with Non-uniform Costs (Q2827804) (← links)
- On complexity of maximizatin of submodular functions<sup>*</sup> (Q4256098) (← links)
- Binary Search in Graphs Revisited (Q5111234) (← links)
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS (Q5692578) (← links)
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS (Q5694440) (← links)