A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search

DOI10.1137/0222049zbMath0794.68027OpenAlexW2027138146MaRDI QIDQ3137714

Edward M. Reingold, Arthur S. Goldstein

Publication date: 10 October 1993

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0222049

zbMATH Keywords

Fibonacci numbersunbounded searchoptimal algorithmsunimodal functionsAckermann's functionKraft's inequalityFibonacci searchinverse Ackermann's functionunimodal search

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Parallel algorithms in computer science (68W10) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Related Items (4)

Precision, local search and unimodal functions ⋮ Approximate location of relevant variables under the crossover distribution. ⋮ Search for the maximum of a random walk ⋮ How many probes are needed to compute the maximum of a random walk?

This page was built for publication: A Fibonacci Version of Kraft’s Inequality Applied to Discrete Unimodal Search