Searching for authors named "Ola Petersson" – sorted by Relevance.
-
Approximate Indexed Lists
- 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
- 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
- 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
- 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
- Sorting and/by Merging Finger Trees Alistair Moffat Ola Petersson y Nicholas C. Wormald z
- Cited by 6 (0 self) – Add To MetaCart

