Searching for "A tight lower bound for searching a sorted array." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

1 documents found, showing 1 through 1.

A Tight Lower Bound for Searching a Sorted Array
by Arne Andersson, Johan Håstad, Ola Petersson — 1995 — in Proc. 27th Annual ACM Symposium on the Theory of Computing
…A tight lower bound for searching a sorted array Arne Andersson Johan Hastad y Ola Petersson…
Cited by 3 (1 self) – Add To MetaCart

Showing 1 through 1.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB