More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case

DOI10.1137/0220010zbMath0716.68046OpenAlexW2010091510MaRDI QIDQ3204043

Edward M. Reingold, Xiao-Jun Shen

Publication date: 1991

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

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

zbMATH Keywords

unbounded searchoptimal algorithmsprefix-freeAckermann's functionKraft's inequality

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Rate of growth of functions, orders of infinity, slowly varying functions (26A12) Prefix, length-variable, comma-free codes (94A45)

Related Items (1)

How many probes are needed to compute the maximum of a random walk?

This page was built for publication: More Nearly Optimal Algorithms for Unbounded Searching, Part I: The Finite Case