Searching ordered structures
From MaRDI portal
Recommendations
Cited in
(30)- Binary search with delayed and missing answers
- Every poset has a central element
- On a 2-dimensional search problem
- Binary search in graphs revisited
- On the optimality of tape merge of two lists with similar size
- Searching monotone multi-dimensional arrays
- On the tree search problem with non-uniform costs
- scientific article; zbMATH DE number 2086235 (Why is no real title available?)
- On the tree search problem with non-uniform costs
- A lower bound for the complexity of information networks for one partial order relation
- Searching Semisorted Tables
- Searching in 2-dimensional partial orders
- scientific article; zbMATH DE number 41347 (Why is no real title available?)
- On complexity of maximizatin of submodular functions*
- Improved approximation algorithms for the average-case tree searching problem
- Searching for quicksand ideals in partially ordered sets
- Binary search in graphs revisited
- Searching in dynamic tree-like partial orders
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
- COMPACT REPRESENTATIONS OF SEARCH IN COMPLEX DOMAINS
- Searching in random partially ordered sets
- Searching rigid data structures
- On paths in search or decision trees which require almost worst-case time
- On the complexity of searching in trees and partially ordered structures
- Parallel searching of multidimensional cubes
- An analysis of Las Vegas algorithms for linear search
- The recursive structure of some ordering problems
- On searching a table consistent with division poset
- The complexity of searching in \(X+Y\) and other multisets
- Edge ranking and searching in partial orders
This page was built for publication: Searching ordered structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3700849)
