A tight lower bound for searching a sorted array - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Arne Andersson' in GoogleThis author has not been identified. Look up 'Johan Håstad' in GoogleThis author has not been identified. Look up 'Ola Petersson' in Google

runs on WebDSL