scientific article; zbMATH DE number 5764837
From MaRDI portal
Publication:3579429
Cited in
(24)- Binary search in graphs revisited
- The binary identification problem for weighted trees
- On the diameter of tree associahedra
- An efficient noisy binary search in graphs via Median approximation
- On the Huffman and alphabetic tree problem with general cost functions
- On the tree search problem with non-uniform costs
- On the tree search problem with non-uniform costs
- Improved approximation algorithms for the average-case tree searching problem
- Searching a Tree with Permanently Noisy Advice
- Binary search in graphs revisited
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
- 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 algorithm for bichromatic sorting with polylog competitive ratio
- On instance-optimal algorithms for a generalization of nuts and bolts and generalized sorting
- The query complexity of searching trees with permanently noisy advice
- Combinatorial generation via permutation languages. IV: Elimination trees
- Randomized binary and tree search under pressure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579429)
