Arne Andersson, Johan Håstad, Ola Petersson. A tight lower bound for searching a sorted array. In Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 29 May-1 June 1995, Las Vegas, Nevada, USA. pages 417-426, ACM, 1995. [doi]
Abstract is missing.