The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Ola Petersson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christos Levcopoulos, Ola Petersson
    An Optimal Adaptive In-place Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    FCT, 1991, pp:329-338 [Conf]
  2. Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter
    Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1990, pp:204-214 [Conf]
  3. Alistair Moffat, Ola Petersson
    Historical Searching and Sorting. [Citation Graph (0, 0)][DBLP]
    ISA, 1991, pp:263-272 [Conf]
  4. Alistair Moffat, Ola Petersson, Nicholas C. Wormald
    Sorting and/by Merging Finger Trees. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1992, pp:499-508 [Conf]
  5. Torben Hagerup, Ola Petersson
    Merging and Sorting Strings in Parallel. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:298-306 [Conf]
  6. Christos Levcopoulos, Ola Petersson
    Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    MFCS, 1990, pp:416-422 [Conf]
  7. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Local Insertion Sort Revisited. [Citation Graph (0, 0)][DBLP]
    Optimal Algorithms, 1989, pp:239-253 [Conf]
  8. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:251-260 [Conf]
  9. Arne Andersson, Ola Petersson
    On-line Approximate List Indexing with Applications. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:20-27 [Conf]
  10. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
    The complexity of searching a sorted array of strings. [Citation Graph (0, 0)][DBLP]
    STOC, 1994, pp:317-325 [Conf]
  11. Arne Andersson, Johan Håstad, Ola Petersson
    A tight lower bound for searching a sorted array. [Citation Graph (0, 0)][DBLP]
    STOC, 1995, pp:417-426 [Conf]
  12. Christos Levcopoulos, Ola Petersson
    Sorting Shuffled Monotone Sequences. [Citation Graph (0, 0)][DBLP]
    SWAT, 1990, pp:181-191 [Conf]
  13. Ola Petersson, Alistair Moffat
    A Framework for Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:422-433 [Conf]
  14. Christos Levcopoulos, Ola Petersson
    Heapsort - Adapted for Presorted Files. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:499-509 [Conf]
  15. Alistair Moffat, Ola Petersson
    An Overview of Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
    Australian Computer Journal, 1992, v:24, n:2, pp:70-77 [Journal]
  16. Alistair Moffat, Ola Petersson, Nicholas C. Wormald
    A Tree-Based Mergesort. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:9, pp:775-793 [Journal]
  17. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Mergesort. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:629-648 [Journal]
  18. Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    A Sublogarithmic Convex Hull Algorithm. [Citation Graph (0, 0)][DBLP]
    BIT, 1990, v:30, n:3, pp:378-384 [Journal]
  19. Christos Levcopoulos, Ola Petersson
    Matching Parentheses in Parallel. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1992, v:40, n:4, pp:423-431 [Journal]
  20. Ola Petersson, Alistair Moffat
    A Framework for Adaptive Sorting. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:59, n:2, pp:153-179 [Journal]
  21. Christos Levcopoulos, Ola Petersson
    Sorting Shuffled Monotone Sequences [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:112, n:1, pp:37-50 [Journal]
  22. Alistair Moffat, Ola Petersson
    Historical Searching. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:1, pp:85-98 [Journal]
  23. Christos Levcopoulos, Ola Petersson
    A Note on Adaptive Parallel Sorting. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:33, n:4, pp:187-191 [Journal]
  24. Christos Levcopoulos, Ola Petersson
    Splitsort - An Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:4, pp:205-211 [Journal]
  25. Jyrki Katajainen, Christos Levcopoulos, Ola Petersson
    Space-Efficient Parallel Merging. [Citation Graph (0, 0)][DBLP]
    ITA, 1993, v:27, n:4, pp:295-310 [Journal]
  26. Arne Andersson, Ola Petersson
    Approximate Indexed Lists. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:256-276 [Journal]
  27. Christos Levcopoulos, Ola Petersson
    Adaptive Heapsort. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1993, v:14, n:3, pp:395-413 [Journal]
  28. Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson
    Tight Bounds for Searching a Sorted Array of Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:5, pp:1552-1578 [Journal]
  29. Alistair Moffat, Gary Eddy, Ola Petersson
    Splaysort: Fast, Versatile, Practical. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1996, v:26, n:7, pp:781-797 [Journal]
  30. Christos Levcopoulos, Ola Petersson
    Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:211-238 [Journal]

Search in 0.090secs, Finished in 0.091secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002