Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Petersson, Ola"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds for searching a sorted array of strings
Arne Andersson
,
Torben Hagerup
,
Johan Håstad
,
Ola Petersson
SIAM Journal on Computing
30
(5), 2000, pp. 1552-1578
Approximate indexed lists
Arne Andersson
,
Ola Petersson
Journal of Algorithms
29
(2), 1998, pp. 256-276
A tree-based Mergesort
Alistair Moffat
,
Ola Petersson
,
Nicholas C. Wormald
Acta Informatica
35
(9), 1998, pp. 775-793
Exploiting few inversions when sorting: Sequential and parallel algorithms
Christos Levcopoulos
,
Ola Petersson
Theoretical Computer Science
163
(1-2), 1996, pp. 211-238
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, STOC'95 (Las Vegas, Nevada, USA, May 29 - June 1, 1995)
, 1995, pp. 417-426
On-line approximate list indexing with applications
Arne Andersson
,
Ola Petersson
Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95 (San Francisdo, California, January 22-24, 1995)
, 1995, pp. 20-27
A framework for adaptive sorting
Ola Petersson
,
Alistair Moffat
Discrete Applied Mathematics
59
, 1995, pp. 153-179
The complexity of searching a sorted array of strings
Arne Andersson
,
Torben Hagerup
,
Johan Håstad
,
Ola Petersson
Proceedings of the 26th Annual ACM Symposium on Theory of Computing, STOC'94 (Montréal, Québec, Canada, May 23-25, 1994)
, 1994, pp. 317-325
Sorting shuffled monotone sequences
Christos Levcopoulos
,
Ola Petersson
Information and Computation
112
(1), 1994, July, pp. 37-50
Sublinear merging and natural mergesort
Svante Carlsson
,
Christos Levcopoulos
,
Ola Petersson
Algorithmica
9
, 1993, pp. 629-648
Adaptive heapsort
Christos Levcopoulos
,
Ola Petersson
Journal of Algorithms
14
(3), 1993, pp. 395-413
Historical searching
Alistair Moffat
,
Ola Petersson
International Journal of Foundations of Computer Science
4
(1), 1993, pp. 85-98
Merging and sorting strings in parallel
Torben Hagerup
,
Ola Petersson
Lecture Notes in Computer Science
629
, 1992, pp. 298-306
Space-efficient parallel merging
Jyrki Katajainen
,
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
605
, 1992, pp. 37-49
Matching parentheses in parallel
Christos Levcopoulos
,
Ola Petersson
Discrete Applied Mathematics
40
, 1992, pp. 423-431
Sorting and/by merging finger trees
Alistair Moffat
,
Ola Petersson
,
Nicholas C. Wormald
Lecture Notes in Computer Science
650
, 1992, pp. 499-508
A framework for adaptive sorting
Ola Petersson
,
Alistair Moffat
Lecture Notes in Computer Science
621
, 1992, pp. 422-433
Splitsort - An adaptive sorting algorithm
Christos Levcopoulos
,
Ola Petersson
Information Processing Letters
39
, 1991, pp. 205-211
An optimal adaptive in-place sorting algorithm
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
529
, 1991, pp. 329-338
Historical searching and sorting
Alistair Moffat
,
Ola Petersson
Lecture Notes in Computer Science
557
, 1991, pp. 263-272
Sublinear merging and natural merge sort
Svante Carlsson
,
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
450
, 1990, pp. 251-260
Optimal parallel algorithms for testing isomorphism of trees and outerplanar graphs
Christos Levcopoulos
,
Andrzej Lingas
,
Ola Petersson
,
Wojciech Rytter
Lecture Notes in Computer Science
472
, 1990, pp. 204-214
Sorting shuffled monotone sequences
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
447
, 1990, pp. 181-191
Heapsort - Adapted for presorted files
Christos Levcopoulos
,
Ola Petersson
Lecture Notes in Computer Science
382
, 1989, pp. 499-509
A note on adaptive parallel sorting
Christos Levcopoulos
,
Ola Petersson
Information Processing Letters
33
, 1989/90, pp. 187-191
Seiten 1
2
>