Optimal Search in Trees
From MaRDI portal
Recommendations
Cited in
(46)- Almost optimal dynamic 2-3 trees
- Efficient selection on a binary tree
- The optimal binary search tree for Andersson's search algorithm
- Binary search in graphs revisited
- The binary identification problem for weighted trees
- An efficient noisy binary search in graphs via Median approximation
- Tree edge decomposition with an application to minimum ultrametric tree approximation
- Computer search for trees with minimal ABC index
- Finding optimal satisficing strategies for and-or trees
- Fast searching in trees
- 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
- scientific article; zbMATH DE number 3853098 (Why is no real title available?)
- Optimal Search Trees with 2-Way Comparisons
- Searching in Trees, Series-Parallel and Interval Orders
- Efficient search algorithm on compact S-trees
- scientific article; zbMATH DE number 1135820 (Why is no real title available?)
- Improved search heuristics for the sa-tree
- Improved approximation algorithms for the average-case tree searching problem
- Searching for quicksand ideals in partially ordered sets
- Searching a Tree with Permanently Noisy Advice
- Optimal parametric search on graphs of bounded tree-width
- Binary search in graphs revisited
- scientific article; zbMATH DE number 5237331 (Why is no real title available?)
- The Optimization of Signed Trees
- Optimal binary search trees
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- Searching in random partially ordered sets
- Competitive Online Search Trees on Trees
- Theoretical analysis of git bisect
- Edge and pair queries-random graphs and complexity
- An approximation algorithm for binary searching in trees
- Theoretical Analysis of Git Bisect
- On the complexity of searching in trees and partially ordered structures
- Partial order multiway search
- An efficient search strategy for hidden ideals in pointed partially ordered sets
- The query complexity of searching trees with permanently noisy advice
- Tight approximation bounds on a simple algorithm for minimum average search time in trees
- Combinatorial generation via permutation languages. IV: Elimination trees
- Noisy (binary) searching: simple, fast and correct
- Randomized binary and tree search under pressure
- Revisiting dynamic programming for finding optimal subtrees in trees
- On searching a table consistent with division poset
- Edge ranking and searching in partial orders
This page was built for publication: Optimal Search in Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268858)
