On Searching Sorted Lists: A Near-Optimal Lower Bound

Paul Beame, Faith E. Fich. On Searching Sorted Lists: A Near-Optimal Lower Bound. Electronic Colloquium on Computational Complexity (ECCC), 5(28), 1998. [doi]

Abstract

Abstract is missing.