Ola Petersson - RankMe

31 papers A* 3B 5Journal 16Unranked 7

Year	Rank	Type	Title / Venue / Authors
2000	J	`jnl`	Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
1998	J	`jnl`	A Tree-Based Mergesort. Acta Informatica Alistair Moffat, Ola Petersson, Nicholas C. Wormald
1998	J	`jnl`	Approximate Indexed Lists. J. Algorithms Arne Andersson, Ola Petersson
1996	J	`jnl`	Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. Christos Levcopoulos, Ola Petersson
1996	J	`jnl`	Splaysort: Fast, Versatile, Practical. Softw. Pract. Exp. Alistair Moffat, Gary Eddy, Ola Petersson
1995	J	`jnl`	A Framework for Adaptive Sorting. Discret. Appl. Math. Ola Petersson, Alistair Moffat
1995	A*	`conf`	A tight lower bound for searching a sorted array. STOC Arne Andersson, Johan Håstad, Ola Petersson
1995	A*	`conf`	On-line Approximate List Indexing with Applications. SODA Arne Andersson, Ola Petersson
1994	J	`jnl`	Sorting Shuffled Monotone Sequences Inf. Comput. Christos Levcopoulos, Ola Petersson
1994	A*	`conf`	The complexity of searching a sorted array of strings. STOC Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
1993	J	`jnl`	Adaptive Heapsort. J. Algorithms Christos Levcopoulos, Ola Petersson
1993	J	`jnl`	Historical Searching. Int. J. Found. Comput. Sci. Alistair Moffat, Ola Petersson
1993	J	`jnl`	Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1993	J	`jnl`	Sublinear Merging and Natural Mergesort. Algorithmica Svante Carlsson, Christos Levcopoulos, Ola Petersson
1992	—	`conf`	A Framework for Adaptive Sorting. SWAT Ola Petersson, Alistair Moffat
1992	J	`jnl`	An Overview of Adaptive Sorting. Aust. Comput. J. Alistair Moffat, Ola Petersson
1992	J	`jnl`	Matching Parentheses in Parallel. Discret. Appl. Math. Christos Levcopoulos, Ola Petersson
1992	B	`conf`	Merging and Sorting Strings in Parallel. MFCS Torben Hagerup, Ola Petersson
1992	B	`conf`	Sorting and/by Merging Finger Trees. ISAAC Alistair Moffat, Ola Petersson, Nicholas C. Wormald
1992	—	`conf`	Space-Efficient Parallel Merging. PARLE Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1991	B	`conf`	An Optimal Adaptive In-place Sorting Algorithm. FCT Christos Levcopoulos, Ola Petersson
1991	—	`conf`	Historical Searching and Sorting. ISA Alistair Moffat, Ola Petersson
1991	J	`jnl`	Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. Christos Levcopoulos, Ola Petersson
1990	J	`jnl`	A Sublogarithmic Convex Hull Algorithm. BIT Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
1990	—	`conf`	Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
1990	—	`conf`	Sorting Shuffled Monotone Sequences. SWAT Christos Levcopoulos, Ola Petersson
1990	B	`conf`	Splitsort - An Adaptive Sorting Algorithm. MFCS Christos Levcopoulos, Ola Petersson
1990	—	`conf`	Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms Svante Carlsson, Christos Levcopoulos, Ola Petersson
1989	J	`jnl`	A Note on Adaptive Parallel Sorting. Inf. Process. Lett. Christos Levcopoulos, Ola Petersson
1989	B	`conf`	Heapsort - Adapted for Presorted Files. WADS Christos Levcopoulos, Ola Petersson
1989	—	`conf`	Local Insertion Sort Revisited. Optimal Algorithms Jyrki Katajainen, Christos Levcopoulos, Ola Petersson