Fibonacci Search

Fibonacci Search is a divide-and-conquer search algorithm that belongs to the class of comparison-based search techniques and is distinguished by its use of Fibonacci numbers to determine the partition points in a sorted array, thereby reducing the search space in a manner that approximates the golden ratio.

142

Publications

6.2K

Citations

310

Authors

160

Institutions

Publications per year

2017–2026

22

Authors

310

  1. ST
    Shmuel T. Klein

    Bar-Ilan University, Israel

    3 publications · 43 citations

    3

    h-index

  2. DS
    Dana Shapira

    Ariel University, Israel

    3 publications · 43 citations

    3

    h-index

  3. ÁP
    Ángel Plaza

    Universidad de Las Palmas de Gran Canaria, Spain

    2 publications · 76 citations

    2

    h-index

  4. RR
    R. Ramaprabha

    Sri Sivasubramaniya Nadar College of Engineering

    2 publications · 165 citations

    2

    h-index

  5. EK
    Ersagun Kürşat Yaylacı

    Sakarya University, Türkiye

    2 publications · 34 citations

    2

    h-index

1–5 of 310

Venues

  1. ˜The œFibonacci quarterly

    15 publications · 357 citations

    13

    h-index

  2. Information Processing Letters

    6 publications · 110 citations

    6

    h-index

  3. Applied Mathematics and Computation

    4 publications · 125 citations

    4

    h-index

  4. Communications of the ACM

    3 publications · 151 citations

    3

    h-index

  5. Management Science

    3 publications · 166 citations

    3

    h-index

1–5