Ola Petersson

According to our database1, Ola Petersson authored at least 28 papers between 1989 and 2000.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


On csauthors.net:


Tight Bounds for Searching a Sorted Array of Strings.
SIAM J. Comput., 2000

Approximate Indexed Lists.
J. Algorithms, 1998

A Tree-Based Mergesort.
Acta Inf., 1998

Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms.
Theor. Comput. Sci., 1996

Splaysort: Fast, Versatile, Practical.
Softw., Pract. Exper., 1996

A tight lower bound for searching a sorted array.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Theory of Computing, 1995

On-line Approximate List Indexing with Applications.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Sorting Shuffled Monotone Sequences
Inf. Comput., July, 1994

The complexity of searching a sorted array of strings.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Adaptive Heapsort.
J. Algorithms, 1993

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

Sublinear Merging and Natural Mergesort.
Algorithmica, 1993

Matching Parentheses in Parallel.
Discrete Applied Mathematics, 1992

An Overview of Adaptive Sorting.
Australian Computer Journal, 1992

A Framework for Adaptive Sorting.
Proceedings of the Algorithm Theory, 1992

Space-Efficient Parallel Merging.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

Merging and Sorting Strings in Parallel.
Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Sorting and/by Merging Finger Trees.
Proceedings of the Algorithms and Computation, Third International Symposium, 1992

Historical Searching and Sorting.
Proceedings of the ISA '91 Algorithms, 1991

An Optimal Adaptive In-place Sorting Algorithm.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

A Sublogarithmic Convex Hull Algorithm.
BIT, 1990

Sorting Shuffled Monotone Sequences.
Proceedings of the SWAT 90, 1990

Sublinear Merging and Natural Merge Sort.
Proceedings of the Algorithms, 1990

Splitsort - An Adaptive Sorting Algorithm.
Proceedings of the Mathematical Foundations of Computer Science 1990, 1990

Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1990

A Note on Adaptive Parallel Sorting.
Inf. Process. Lett., 1989

Heapsort - Adapted for Presorted Files.
Proceedings of the Algorithms and Data Structures, 1989

Local Insertion Sort Revisited.
Proceedings of the Optimal Algorithms, International Symposium, Varna, Bulgaria, May 29, 1989