Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders

  title={Generalization of Binary Search: Searching in Trees and Forest-Like Partial Orders},
  author={Krzysztof Onak and Pawel Parys},
  journal={2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)},
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach to this sort of problem, and apply it to both cases, achieving algorithms constructing optimal decision trees. In the edge query model the problem is identical to the problem of searching in a special class of tree-like posets stated by Ben-Asher et al. (1999). Our upper bound on computation time, O(n3 ), improves the… CONTINUE READING

From This Paper

Figures, tables, results, connections, and topics extracted from this paper.
25 Extracted Citations
10 Extracted References
Similar Papers

Referenced Papers

Publications referenced by this paper.
Showing 1-10 of 10 references

Sorting and Searching

  • D. E. Knuth
  • volume 3 of The Art of Computer Programming…
  • 1998
1 Excerpt

Fibonaccian searching

  • D. E. Ferguson
  • Communications of the ACM, 3(12):648
  • 1960
1 Excerpt

Similar Papers

Loading similar papers…