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
Parents
142
Quasiperiodic GaAs-AlAs Heterostructures
R. Merlín, K. Bajema, Roy Clarke et al. · Physical Review Letters · 1985 · 837 citations
Branch-and-Bound Methods: General Formulation and Properties
L. G. Mitten · Operations Research · 1970 · 331 citations
Depth from focusing and defocusing
Yingjie Xiong, Steven A. Shafer · 2002 · 215 citations
1–5 of 142
310
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 310
160
Stanford University
Stanford, United States
4 h-index
8 publications
466 citations

Bar-Ilan University
Ramat Gan, Israel
3 h-index
3 publications
43 citations
Seoul National University
Seoul, South Korea
3 h-index
6 publications
372 citations

Atatürk University
Erzurum, Türkiye
3 h-index
4 publications
98 citations
Karabük University
Karabük, Türkiye
2 h-index
6 publications
78 citations
Korea Institute for Advanced Study
Seoul, South Korea
2 h-index
7 publications
282 citations
Sakarya University
Adapazarı, Türkiye
2 h-index
6 publications
78 citations
San Jose State University
San Jose, United States
2 h-index
3 publications
71 citations
1–8 of 160
15 publications · 357 citations
13
h-index
6 publications · 110 citations
6
h-index
4 publications · 125 citations
4
h-index
3 publications · 151 citations
3
h-index
3 publications · 166 citations
3
h-index
1–5