|
Search the dblp DataBase
Ola Petersson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Christos Levcopoulos, Ola Petersson
An Optimal Adaptive In-place Sorting Algorithm. [Citation Graph (0, 0)][DBLP] FCT, 1991, pp:329-338 [Conf]
- Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. [Citation Graph (0, 0)][DBLP] FSTTCS, 1990, pp:204-214 [Conf]
- Alistair Moffat, Ola Petersson
Historical Searching and Sorting. [Citation Graph (0, 0)][DBLP] ISA, 1991, pp:263-272 [Conf]
- Alistair Moffat, Ola Petersson, Nicholas C. Wormald
Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP] ISAAC, 1992, pp:499-508 [Conf]
- Torben Hagerup, Ola Petersson
Merging and Sorting Strings in Parallel. [Citation Graph (0, 0)][DBLP] MFCS, 1992, pp:298-306 [Conf]
- Christos Levcopoulos, Ola Petersson
Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP] MFCS, 1990, pp:416-422 [Conf]
- Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Local Insertion Sort Revisited. [Citation Graph (0, 0)][DBLP] Optimal Algorithms, 1989, pp:239-253 [Conf]
- Svante Carlsson, Christos Levcopoulos, Ola Petersson
Sublinear Merging and Natural Merge Sort. [Citation Graph (0, 0)][DBLP] SIGAL International Symposium on Algorithms, 1990, pp:251-260 [Conf]
- Arne Andersson, Ola Petersson
On-line Approximate List Indexing with Applications. [Citation Graph (0, 0)][DBLP] SODA, 1995, pp:20-27 [Conf]
- Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
The complexity of searching a sorted array of strings. [Citation Graph (0, 0)][DBLP] STOC, 1994, pp:317-325 [Conf]
- Arne Andersson, Johan Håstad, Ola Petersson
A tight lower bound for searching a sorted array. [Citation Graph (0, 0)][DBLP] STOC, 1995, pp:417-426 [Conf]
- Christos Levcopoulos, Ola Petersson
Sorting Shuffled Monotone Sequences. [Citation Graph (0, 0)][DBLP] SWAT, 1990, pp:181-191 [Conf]
- Ola Petersson, Alistair Moffat
A Framework for Adaptive Sorting. [Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:422-433 [Conf]
- Christos Levcopoulos, Ola Petersson
Heapsort - Adapted for Presorted Files. [Citation Graph (0, 0)][DBLP] WADS, 1989, pp:499-509 [Conf]
- Alistair Moffat, Ola Petersson
An Overview of Adaptive Sorting. [Citation Graph (0, 0)][DBLP] Australian Computer Journal, 1992, v:24, n:2, pp:70-77 [Journal]
- Alistair Moffat, Ola Petersson, Nicholas C. Wormald
A Tree-Based Mergesort. [Citation Graph (0, 0)][DBLP] Acta Inf., 1998, v:35, n:9, pp:775-793 [Journal]
- Svante Carlsson, Christos Levcopoulos, Ola Petersson
Sublinear Merging and Natural Mergesort. [Citation Graph (0, 0)][DBLP] Algorithmica, 1993, v:9, n:6, pp:629-648 [Journal]
- Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
A Sublogarithmic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP] BIT, 1990, v:30, n:3, pp:378-384 [Journal]
- Christos Levcopoulos, Ola Petersson
Matching Parentheses in Parallel. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1992, v:40, n:4, pp:423-431 [Journal]
- Ola Petersson, Alistair Moffat
A Framework for Adaptive Sorting. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1995, v:59, n:2, pp:153-179 [Journal]
- Christos Levcopoulos, Ola Petersson
Sorting Shuffled Monotone Sequences [Citation Graph (0, 0)][DBLP] Inf. Comput., 1994, v:112, n:1, pp:37-50 [Journal]
- Alistair Moffat, Ola Petersson
Historical Searching. [Citation Graph (0, 0)][DBLP] Int. J. Found. Comput. Sci., 1993, v:4, n:1, pp:85-98 [Journal]
- Christos Levcopoulos, Ola Petersson
A Note on Adaptive Parallel Sorting. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1989, v:33, n:4, pp:187-191 [Journal]
- Christos Levcopoulos, Ola Petersson
Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1991, v:39, n:4, pp:205-211 [Journal]
- Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
Space-Efficient Parallel Merging. [Citation Graph (0, 0)][DBLP] ITA, 1993, v:27, n:4, pp:295-310 [Journal]
- Arne Andersson, Ola Petersson
Approximate Indexed Lists. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1998, v:29, n:2, pp:256-276 [Journal]
- Christos Levcopoulos, Ola Petersson
Adaptive Heapsort. [Citation Graph (0, 0)][DBLP] J. Algorithms, 1993, v:14, n:3, pp:395-413 [Journal]
- Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
Tight Bounds for Searching a Sorted Array of Strings. [Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:5, pp:1552-1578 [Journal]
- Alistair Moffat, Gary Eddy, Ola Petersson
Splaysort: Fast, Versatile, Practical. [Citation Graph (0, 0)][DBLP] Softw., Pract. Exper., 1996, v:26, n:7, pp:781-797 [Journal]
- Christos Levcopoulos, Ola Petersson
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 1996, v:163, n:1&2, pp:211-238 [Journal]
Search in 0.003secs, Finished in 0.004secs
|