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