Arne Andersson, Johan Håstad, Ola Petersson
A tight lower bound for searching a sorted array
STOC, 1995.
@inproceedings{STOC-1995-AnderssonHP,
author = "Arne Andersson and Johan Håstad and Ola Petersson",
booktitle = "{Proceedings of the 27th Annual ACM Symposium on Theory of Computing}",
doi = "10.1145/225058.225171",
isbn = "0-89791-718-9",
pages = "417--426",
publisher = "{ACM}",
title = "{A tight lower bound for searching a sorted array}",
year = 1995,
}











