default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvante Carlsson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
[j19]Andrej Brodnik
, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro:
Worst case constant time priority queue. J. Syst. Softw. 78(3): 249-256 (2005)- 2002
- [j18]Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro:
Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. 12(4): 283-296 (2002) - 2001
- [c23]Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro:
Worst case constant time priority queue. SODA 2001: 523-528 - 2000
- [c22]Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz:
Online Routing in Convex Subdivisions. ISAAC 2000: 47-59
1990 – 1999
- 1999
- [j17]Svante Carlsson, Bengt J. Nilsson:
Computing Vision Points in Polygons. Algorithmica 24(1): 50-75 (1999) - [j16]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. 22(3): 377-402 (1999) - [c21]Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick:
Resizable Arrays in Optimal Time and Space. WADS 1999: 37-48 - 1998
- [c20]Esther Jennings, Svante Carlsson:
An optimal distributed 3-edge-connected component algorithm. SIROCCO 1998: 129-144 - 1997
- [c19]Gerd Brandell, Svante Carlsson, Håkan Ekblom, Ann-Charlotte Nord:
A single-sex programme in computer science and engineering (poster). ITiCSE-WGR 1997: 146 - [c18]Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink:
Small Forwarding Tables for Fast Routing Lookups. SIGCOMM 1997: 3-14 - 1996
- [j15]Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. Theor. Comput. Sci. 164(1&2): 1-12 (1996) - 1995
- [c17]Svante Carlsson, Jingsen Chen:
Searching Rigid Data Structures (Extended Abstract). COCOON 1995: 446-451 - [c16]Svante Carlsson, Mikael Sundström:
Linear-time In-place Selection in Less than 3n Comparisons. ISAAC 1995: 244-253 - [c15]Svante Carlsson, Jingsen Chen:
Heap Construction: Optimal in Both Worst and Average Cases? ISAAC 1995: 254-263 - [c14]Svante Carlsson, Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. WADS 1995: 122-134 - 1994
- [c13]Svante Carlsson, Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms. ESA 1994: 106-117 - [c12]Svante Carlsson, Jingsen Chen, Christer Mattsson:
Heaps with Bits. ISAAC 1994: 288-296 - 1993
- [j14]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Mergesort. Algorithmica 9(6): 629-648 (1993) - [j13]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. 3(1): 85-105 (1993) - [c11]Svante Carlsson, Håkan Jonsson:
Guarding a Treasury. CCCG 1993: 85-90 - [c10]Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon. ISAAC 1993: 58-67 - [e1]Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson:
Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings. Lecture Notes in Computer Science 700, Springer 1993, ISBN 3-540-56939-1 [contents] - 1992
- [j12]Svante Carlsson, Jingsen Chen:
On Partitions and Presortedness of Sequences. Acta Informatica 29(3): 267-280 (1992) - [j11]Mark de Berg, Svante Carlsson, Mark H. Overmars:
A General Approach to Dominance in the Plane. J. Algorithms 13(2): 274-296 (1992) - [j10]Svante Carlsson, Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps. Parallel Process. Lett. 2: 311-320 (1992) - [c9]Svante Carlsson, Jingsen Chen:
Parallel Complexity of Heaps and Min-Max Heaps. LATIN 1992: 108-116 - [c8]Svante Carlsson, Jingsen Chen:
The Complexity of Heaps. SODA 1992: 393-402 - [c7]Svante Carlsson, Jyrki Katajainen, Jukka Teuhola:
In-place Linear Probing Sort. STACS 1992: 581-587 - 1991
- [j9]Svante Carlsson:
An Optimal Algorithm for Deleting the Root of a Heap. Inf. Process. Lett. 37(2): 117-120 (1991) - [j8]Svante Carlsson, Jingsen Chen:
An Optimal Parallel Adaptive Sorting Algorithm. Inf. Process. Lett. 39(4): 195-200 (1991) - [c6]Jingsen Chen, Svante Carlsson:
On Partitions and Presortedness of Sequences. SODA 1991: 62-71 - [c5]Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson:
A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. STACS 1991: 296-308 - [c4]Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS 1991: 367-378 - 1990
- [j7]Arne Andersson, Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space. Inf. Process. Lett. 34(1): 21-25 (1990) - [c3]Svante Carlsson, Christos Levcopoulos, Ola Petersson:
Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms 1990: 251-260
1980 – 1989
- 1989
- [j6]Svante Carlsson, Jingsen Chen, Thomas Strothotte:
A Note on the Construction of Data Structure "DEAP". Inf. Process. Lett. 31(6): 315-317 (1989) - 1988
- [c2]Svante Carlsson, J. Ian Munro, Patricio V. Poblete:
An Implicit Binomial Queue with Constant Insertion Time. SWAT 1988: 1-13 - [c1]Svante Carlsson, Christer Mattsson:
An Extrapolation on the Interpolation Search. SWAT 1988: 24-33 - 1987
- [j5]Svante Carlsson:
Average-Case Results on Heapsort. BIT 27(1): 2-17 (1987) - [j4]Svante Carlsson:
A Variant of Heapsort with Almost Optimal Number of Comparisons. Inf. Process. Lett. 24(4): 247-250 (1987) - [j3]Svante Carlsson:
The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. Inf. Process. Lett. 26(1): 33-36 (1987) - 1986
- [j2]Svante Carlsson:
Splitmerge - A Fast Stable Merging Algorithm. Inf. Process. Lett. 22(4): 189-192 (1986) - 1984
- [j1]Svante Carlsson:
Improving Worst-Case Behavior of Heaps. BIT 24(1): 14-18 (1984)
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-24 23:11 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:
