All publications

EUCLID / RESEARCH OUTPUT

Preprint

(α, β) Fibonacci Search

Pavlos S. Efraimidis

arXiv · Dec 2010

Abstract

Knuth [12, Page 417] states that "the (program of the) Fibonaccian search technique looks very mysterious at first glance" and that "it seems to work by magic". In this work, we show that there is even more magic in Fibonaccian (or else Fibonacci) search. We present a generalized Fibonacci procedure that follows perfectly the implicit optimal decision tree for search problems where the cost of each comparison depends on its outcome.

CITATION

BibTeX

efraimidis2010fibonacci 
@misc{efraimidis2010fibonacci,
  author = {Pavlos S. Efraimidis},
  title = {(α, β) Fibonacci Search},
  year = {2010},
  month = {dec},
  eprint = {1012.0259},
  archivePrefix = {arXiv},
  primaryClass = {cs.DS},
  url = {https://arxiv.org/abs/1012.0259}
}
Back to publications