A tight lower bound for searching a sorted array.

Arne Andersson Johan Håstad Ola Petersson A tight lower bound for searching a sorted array. 417-426 1995 conf/stoc/STOC27 STOC http://doi.acm.org/10.1145/225058.225171 db/conf/stoc/stoc1995.html#AnderssonHP95