Ola Petersson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 30 from 30

2000

Tight Bounds for Searching a Sorted Array of StringsArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson. SICOMP, 30(5):1552-1578, 2000. [doi]

1998

Approximate Indexed ListsArne Andersson, Ola Petersson. jal, 29(2):256-276, 1998.

A Tree-Based MergesortAlistair Moffat, Ola Petersson, Nicholas C. Wormald. ACTA, 35(9):775-793, 1998. [doi]

1996

Exploiting Few Inversions When Sorting: Sequential and Parallel AlgorithmsChristos Levcopoulos, Ola Petersson. TCS, 163(1&2):211-238, 1996. [doi]

Splaysort: Fast, Versatile, PracticalAlistair Moffat, Gary Eddy, Ola Petersson. SPE, 26(7):781-797, 1996.

1995

On-line Approximate List Indexing with ApplicationsArne Andersson, Ola Petersson. soda 1995: 20-27

A tight lower bound for searching a sorted arrayArne Andersson, Johan Håstad, Ola Petersson. stoc 1995: 417-426 [doi]

A Framework for Adaptive SortingOla Petersson, Alistair Moffat. DAM, 59(2):153-179, 1995. [doi]

1994

The complexity of searching a sorted array of stringsArne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson. stoc 1994: 317-325 [doi]

Sorting Shuffled Monotone SequencesChristos Levcopoulos, Ola Petersson. iandc, 112(1):37-50, July 1994.

1993

Sublinear Merging and Natural MergesortSvante Carlsson, Christos Levcopoulos, Ola Petersson. algorithmica, 9(6):629-648, 1993.

Space-Efficient Parallel MergingJyrki Katajainen, Christos Levcopoulos, Ola Petersson. ita, 27(4):295-310, 1993.

Adaptive HeapsortChristos Levcopoulos, Ola Petersson. jal, 14(3):395-413, 1993.

Historical SearchingAlistair Moffat, Ola Petersson. ijfcs, 4(1):85-98, 1993.

1992

Merging and Sorting Strings in ParallelTorben Hagerup, Ola Petersson. mfcs 1992: 298-306

Matching Parentheses in ParallelChristos Levcopoulos, Ola Petersson. DAM, 40(4):423-431, 1992.

An Overview of Adaptive SortingAlistair Moffat, Ola Petersson. acj, 24(2):70-77, 1992.

Sorting and/by Merging Finger TreesAlistair Moffat, Ola Petersson, Nicholas C. Wormald. isaac 1992: 499-508

A Framework for Adaptive SortingOla Petersson, Alistair Moffat. swat 1992: 422-433

1991

An Optimal Adaptive In-place Sorting AlgorithmChristos Levcopoulos, Ola Petersson. fct 1991: 329-338

Splitsort - An Adaptive Sorting AlgorithmChristos Levcopoulos, Ola Petersson. ipl, 39(4):205-211, 1991.

Historical Searching and SortingAlistair Moffat, Ola Petersson. sersc-isa 1991: 263-272

1990

1989

Local Insertion Sort RevisitedJyrki Katajainen, Christos Levcopoulos, Ola Petersson. oa 1989: 239-253

Heapsort - Adapted for Presorted FilesChristos Levcopoulos, Ola Petersson. wads 1989: 499-509

A Note on Adaptive Parallel SortingChristos Levcopoulos, Ola Petersson. ipl, 33(4):187-191, 1989.

Sign in or sign up to see more results.

runs on WebDSL