MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for authors named "Ola Petersson" – sorted by Relevance.

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

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

5 documents found, showing 1 through 5.

ATOM

Approximate Indexed Lists
by Arne Andersson, Ola Petersson — 1998 — Journal of Algorithms
…Approximate indexed lists Arne Andersson Ola Petersson y Abstract Let the position of a list…
Cited by 10 (0 self) – Add To MetaCart

Tight Bounds for Searching a Sorted Array of Strings
by Arne Andersson, Torben Hagerup, Johan Hastad, Ola Petersson — 2000
… Hastad z Ola Petersson x August 1, 2000 Abstract Given a k-character query string and an array of n…
Cited by 5 (0 self) – Add To MetaCart

The Complexity of Searching a Sorted Array of Strings
by Arne Andersson, Torben Hagerup, Johan Hastad, Ola Petersson — 1994 — In Proc. 26th Ann. ACM Symp. on Theory of Computing
… of searching a sorted array of strings Arne Andersson Torben Hagerup y Johan Hastad z Ola Petersson x…
Cited by 4 (2 self) – Add To MetaCart

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

Sorting and/by Merging Finger Trees
by Alistair Moffat, Ola Petersson, Nicholas C. Wormald — 1992 — In Algorithms and Computation: Third International Symposium, ISAAC ’92
… Sorting and/by Merging Finger Trees Alistair Moffat Ola Petersson y Nicholas C. Wormald z…
Cited by 6 (0 self) – Add To MetaCart

Showing 1 through 5.

ATOM

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