scientific article
From MaRDI portal
Publication:3579429
zbMath1192.68242MaRDI QIDQ3579429
Krzysztof Onak, Oren Weimann, Shay Mozes
Publication date: 6 August 2010
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (17)
On the tree search problem with non-uniform costs ⋮ Theoretical analysis of git bisect ⋮ Edge and pair queries-random graphs and complexity ⋮ An approximation algorithm for binary searching in trees ⋮ On the complexity of searching in trees and partially ordered structures ⋮ Improved approximation algorithms for the average-case tree searching problem ⋮ Binary search in graphs revisited ⋮ Searching a Tree with Permanently Noisy Advice ⋮ On the diameter of tree associahedra ⋮ On the Huffman and alphabetic tree problem with general cost functions ⋮ The binary identification problem for weighted trees ⋮ The complexity of bicriteria tree-depth ⋮ The complexity of bicriteria tree-depth ⋮ On the Tree Search Problem with Non-uniform Costs ⋮ Binary Search in Graphs Revisited ⋮ Competitive Online Search Trees on Trees ⋮ An efficient noisy binary search in graphs via Median approximation
This page was built for publication:
