Ola Petersson

According to our database, Ola Petersson authored at least 27 papers between 1989 and 2000.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2000

Tight Bounds for Searching a Sorted Array of Strings.

Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson

SIAM J. Comput., 2000

1998

Approximate Indexed Lists.

Arne Andersson, Ola Petersson

J. Algorithms, 1998

A Tree-Based Mergesort.

Alistair Moffat, Ola Petersson, Nicholas C. Wormald

Acta Informatica, 1998

1996

Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.

Christos Levcopoulos, Ola Petersson

Theor. Comput. Sci., 1996

Splaysort: Fast, Versatile, Practical.

Alistair Moffat, Gary Eddy, Ola Petersson

Softw. Pract. Exp., 1996

1995

A Framework for Adaptive Sorting.

Ola Petersson, Alistair Moffat

Discret. Appl. Math., 1995

A tight lower bound for searching a sorted array.

Arne Andersson, Johan Håstad, Ola Petersson

Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On-line Approximate List Indexing with Applications.

Arne Andersson, Ola Petersson

Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

1994

Sorting Shuffled Monotone Sequences

Christos Levcopoulos, Ola Petersson

Inf. Comput., July, 1994

The complexity of searching a sorted array of strings.

Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson

Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

1993

Adaptive Heapsort.

Christos Levcopoulos, Ola Petersson

J. Algorithms, 1993

Space-Efficient Parallel Merging.

Jyrki Katajainen, Christos Levcopoulos, Ola Petersson

RAIRO Theor. Informatics Appl., 1993

Historical Searching.

Alistair Moffat, Ola Petersson

Int. J. Found. Comput. Sci., 1993

Sublinear Merging and Natural Mergesort.

Svante Carlsson, Christos Levcopoulos, Ola Petersson

Algorithmica, 1993

1992

Matching Parentheses in Parallel.

Christos Levcopoulos, Ola Petersson

Discret. Appl. Math., 1992

An Overview of Adaptive Sorting.

Alistair Moffat, Ola Petersson

Aust. Comput. J., 1992

Merging and Sorting Strings in Parallel.

Torben Hagerup, Ola Petersson

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Sorting and/by Merging Finger Trees.

Alistair Moffat, Ola Petersson, Nicholas C. Wormald

Proceedings of the Algorithms and Computation, Third International Symposium, 1992

1991

Splitsort - An Adaptive Sorting Algorithm.

Christos Levcopoulos, Ola Petersson

Inf. Process. Lett., 1991

Historical Searching and Sorting.

Alistair Moffat, Ola Petersson

Proceedings of the ISA '91 Algorithms, 1991

An Optimal Adaptive In-place Sorting Algorithm.

Christos Levcopoulos, Ola Petersson

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

1990

A Sublogarithmic Convex Hull Algorithm.

Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson

BIT, 1990

Sublinear Merging and Natural Merge Sort.

Svante Carlsson, Christos Levcopoulos, Ola Petersson

Proceedings of the Algorithms, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.

Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter

Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

1989

A Note on Adaptive Parallel Sorting.

Christos Levcopoulos, Ola Petersson

Inf. Process. Lett., 1989

Heapsort - Adapted for Presorted Files.

Christos Levcopoulos, Ola Petersson

Proceedings of the Algorithms and Data Structures, 1989

Local Insertion Sort Revisited.

Jyrki Katajainen, Christos Levcopoulos, Ola Petersson

Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989