default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOla Petersson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2000
[j16]Arne Andersson, Torben Hagerup, Johan Håstad
, Ola Petersson:
Tight Bounds for Searching a Sorted Array of Strings. SIAM J. Comput. 30(5): 1552-1578 (2000)
1990 – 1999
- 1998
- [j15]Alistair Moffat, Ola Petersson, Nicholas C. Wormald:
A Tree-Based Mergesort. Acta Informatica 35(9): 775-793 (1998) - [j14]Arne Andersson, Ola Petersson:
Approximate Indexed Lists. J. Algorithms 29(2): 256-276 (1998) - 1996
- [j13]Alistair Moffat, Gary Eddy, Ola Petersson:
Splaysort: Fast, Versatile, Practical. Softw. Pract. Exp. 26(7): 781-797 (1996) - [j12]Christos Levcopoulos, Ola Petersson:
Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. Theor. Comput. Sci. 163(1&2): 211-238 (1996) - 1995
- [j11]Ola Petersson, Alistair Moffat:
A Framework for Adaptive Sorting. Discret. Appl. Math. 59(2): 153-179 (1995) - [c15]Arne Andersson, Ola Petersson:
On-line Approximate List Indexing with Applications. SODA 1995: 20-27 - [c14]Arne Andersson, Johan Håstad, Ola Petersson:
A tight lower bound for searching a sorted array. STOC 1995: 417-426 - 1994
- [j10]Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. Inf. Comput. 112(1): 37-50 (1994) - [c13]Arne Andersson, Torben Hagerup, Johan Håstad, Ola Petersson:
The complexity of searching a sorted array of strings. STOC 1994: 317-325 - 1993
- [j9]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993) - [j8]Alistair Moffat, Ola Petersson:
Historical Searching. Int. J. Found. Comput. Sci. 4(1): 85-98 (1993) - [j7]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. RAIRO Theor. Informatics Appl. 27(4): 295-310 (1993) - [j6]Christos Levcopoulos, Ola Petersson:
Adaptive Heapsort. J. Algorithms 14(3): 395-413 (1993) - 1992
- [j5]Alistair Moffat, Ola Petersson:
An Overview of Adaptive Sorting. Aust. Comput. J. 24(2): 70-77 (1992) - [j4]Christos Levcopoulos, Ola Petersson:
Matching Parentheses in Parallel. Discret. Appl. Math. 40(4): 423-431 (1992) - [c12]Alistair Moffat, Ola Petersson, Nicholas C. Wormald:
Sorting and/by Merging Finger Trees. ISAAC 1992: 499-508 - [c11]Torben Hagerup, Ola Petersson:
Merging and Sorting Strings in Parallel. MFCS 1992: 298-306 - [c10]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Space-Efficient Parallel Merging. PARLE 1992: 37-49 - [c9]Ola Petersson, Alistair Moffat:
A Framework for Adaptive Sorting. SWAT 1992: 422-433 - 1991
- [j3]Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 205-211 (1991) - [c8]Christos Levcopoulos, Ola Petersson:
An Optimal Adaptive In-place Sorting Algorithm. FCT 1991: 329-338 - [c7]Alistair Moffat, Ola Petersson:
Historical Searching and Sorting. ISA 1991: 263-272 - 1990
- [j2]Per-Olof Fjällström, Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
A Sublogarithmic Convex Hull Algorithm. BIT 30(3): 378-384 (1990) - [c6]Christos Levcopoulos, Andrzej Lingas, Ola Petersson, Wojciech Rytter:
Optimal Parallel Algorithms for Testing Isomorphism of Trees and Outerplanar Graphs. FSTTCS 1990: 204-214 - [c5]Christos Levcopoulos, Ola Petersson:
Splitsort - An Adaptive Sorting Algorithm. MFCS 1990: 416-422 - [c4]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms 1990: 251-260 - [c3]Christos Levcopoulos, Ola Petersson:
Sorting Shuffled Monotone Sequences. SWAT 1990: 181-191
1980 – 1989
- 1989
- [j1]Christos Levcopoulos, Ola Petersson:
A Note on Adaptive Parallel Sorting. Inf. Process. Lett. 33(4): 187-191 (1989) - [c2]Jyrki Katajainen, Christos Levcopoulos, Ola Petersson:
Local Insertion Sort Revisited. Optimal Algorithms 1989: 239-253 - [c1]Christos Levcopoulos, Ola Petersson:
Heapsort - Adapted for Presorted Files. WADS 1989: 499-509
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
