scientific article; zbMATH DE number 5764837
From MaRDI portal
Publication:3579429
zbMATH Open1192.68242MaRDI QIDQ3579429FDOQ3579429
Authors: Shay Mozes, Krzysztof Onak, Oren Weimann 
Publication date: 6 August 2010
Title of this publication is not available (Why is that?)
Cited In (19)
- On the tree search problem with non-uniform costs
- On the diameter of tree associahedra
- On the Huffman and alphabetic tree problem with general cost functions
- Binary search in graphs revisited
- Binary search in graphs revisited
- An efficient noisy binary search in graphs via Median approximation
- Competitive Online Search Trees on Trees
- Partial order multiway search
- On the tree search problem with non-uniform costs
- Edge and pair queries-random graphs and complexity
- Improved approximation algorithms for the average-case tree searching problem
- An approximation algorithm for binary searching in trees
- On the complexity of searching in trees and partially ordered structures
- The binary identification problem for weighted trees
- Theoretical Analysis of Git Bisect
- Searching a Tree with Permanently Noisy Advice
- Theoretical analysis of git bisect
- The complexity of bicriteria tree-depth
- The complexity of bicriteria tree-depth
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)
