| 2005 |
|---|
| 42 | EE | Andrej Brodnik,
Svante Carlsson,
Michael L. Fredman,
Johan Karlsson,
J. Ian Munro:
Worst case constant time priority queue.
Journal of Systems and Software 78(3): 249-256 (2005) |
| 2002 |
|---|
| 41 | EE | 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. Geometry Appl. 12(4): 283-296 (2002) |
| 2001 |
|---|
| 40 | EE | Andrej Brodnik,
Svante Carlsson,
Johan Karlsson,
J. Ian Munro:
Worst case constant time priority queue.
SODA 2001: 523-528 |
| 2000 |
|---|
| 39 | EE | 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 |
| 1999 |
|---|
| 38 | EE | Andrej Brodnik,
Svante Carlsson,
Erik D. Demaine,
J. Ian Munro,
Robert Sedgewick:
Resizable Arrays in Optimal Time and Space.
WADS 1999: 37-48 |
| 37 | EE | Svante Carlsson,
Bengt J. Nilsson:
Computing Vision Points in Polygons.
Algorithmica 24(1): 50-75 (1999) |
| 36 | EE | Svante Carlsson,
Håkan Jonsson,
Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon.
Discrete & Computational Geometry 22(3): 377-402 (1999) |
| 1998 |
|---|
| 35 | | Esther Jennings,
Svante Carlsson:
An optimal distributed 3-edge-connected component algorithm.
SIROCCO 1998: 129-144 |
| 1997 |
|---|
| 34 | EE | Mikael Degermark,
Andrej Brodnik,
Svante Carlsson,
Stephen Pink:
Small Forwarding Tables for Fast Routing Lookups.
SIGCOMM 1997: 3-14 |
| 1996 |
|---|
| 33 | EE | Svante Carlsson,
Jingsen Chen,
Christer Mattsson:
Heaps with Bits.
Theor. Comput. Sci. 164(1&2): 1-12 (1996) |
| 1995 |
|---|
| 32 | | Svante Carlsson,
Jingsen Chen:
Searching Rigid Data Structures (Extended Abstract).
COCOON 1995: 446-451 |
| 31 | | Svante Carlsson,
Mikael Sundström:
Linear-time In-place Selection in Less than 3n Comparisons.
ISAAC 1995: 244-253 |
| 30 | | Svante Carlsson,
Jingsen Chen:
Heap Construction: Optimal in Both Worst and Average Cases?
ISAAC 1995: 254-263 |
| 29 | | Svante Carlsson,
Håkan Jonsson:
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.
WADS 1995: 122-134 |
| 1994 |
|---|
| 28 | | Svante Carlsson,
Jingsen Chen:
Some Lower Bounds for Comparison-Based Algorithms.
ESA 1994: 106-117 |
| 27 | | Svante Carlsson,
Jingsen Chen,
Christer Mattsson:
Heaps with Bits.
ISAAC 1994: 288-296 |
| 1993 |
|---|
| 26 | | Andrzej Lingas,
Rolf G. Karlsson,
Svante Carlsson:
Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings
Springer 1993 |
| 25 | | Svante Carlsson,
Håkan Jonsson:
Guarding a Treasury.
CCCG 1993: 85-90 |
| 24 | | Svante Carlsson,
Håkan Jonsson,
Bengt J. Nilsson:
Finding the Shortest Watchman Route in a Simple Polygon.
ISAAC 1993: 58-67 |
| 23 | | Svante Carlsson,
Christos Levcopoulos,
Ola Petersson:
Sublinear Merging and Natural Mergesort.
Algorithmica 9(6): 629-648 (1993) |
| 22 | | Svante Carlsson,
Bengt J. Nilsson,
Simeon C. Ntafos:
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.
Int. J. Comput. Geometry Appl. 3(1): 85-105 (1993) |
| 1992 |
|---|
| 21 | | Svante Carlsson,
Jingsen Chen:
Parallel Complexity of Heaps and Min-Max Heaps.
LATIN 1992: 108-116 |
| 20 | EE | Svante Carlsson,
Jingsen Chen:
The Complexity of Heaps.
SODA 1992: 393-402 |
| 19 | | Svante Carlsson,
Jyrki Katajainen,
Jukka Teuhola:
In-place Linear Probing Sort.
STACS 1992: 581-587 |
| 18 | | Svante Carlsson,
Jingsen Chen:
On Partitions and Presortedness of Sequences.
Acta Inf. 29(3): 267-280 (1992) |
| 17 | | Mark de Berg,
Svante Carlsson,
Mark H. Overmars:
A General Approach to Dominance in the Plane.
J. Algorithms 13(2): 274-296 (1992) |
| 16 | | Svante Carlsson,
Jingsen Chen:
Parallel Constructions of Heaps and Min-Max Heaps.
Parallel Processing Letters 2: 311-320 (1992) |
| 1991 |
|---|
| 15 | | Jingsen Chen,
Svante Carlsson:
On Partitions and Presortedness of Sequences.
SODA 1991: 62-71 |
| 14 | | 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 |
| 13 | | Svante Carlsson,
Bengt J. Nilsson,
Simeon C. Ntafos:
Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
WADS 1991: 367-378 |
| 12 | | Svante Carlsson:
An Optimal Algorithm for Deleting the Root of a Heap.
Inf. Process. Lett. 37(2): 117-120 (1991) |
| 11 | | Svante Carlsson,
Jingsen Chen:
An Optimal Parallel Adaptive Sorting Algorithm.
Inf. Process. Lett. 39(4): 195-200 (1991) |
| 1990 |
|---|
| 10 | | Svante Carlsson,
Christos Levcopoulos,
Ola Petersson:
Sublinear Merging and Natural Merge Sort.
SIGAL International Symposium on Algorithms 1990: 251-260 |
| 9 | | Arne Andersson,
Svante Carlsson:
Construction of a Tree From its Traversals in Optimal Time and Space.
Inf. Process. Lett. 34(1): 21-25 (1990) |
| 1989 |
|---|
| 8 | | Svante Carlsson,
Jingsen Chen,
Thomas Strothotte:
A Note on the Construction of Data Structure ``DEAP''.
Inf. Process. Lett. 31(6): 315-317 (1989) |
| 1988 |
|---|
| 7 | | Svante Carlsson,
J. Ian Munro,
Patricio V. Poblete:
An Implicit Binomial Queue with Constant Insertion Time.
SWAT 1988: 1-13 |
| 6 | | Svante Carlsson,
Christer Mattsson:
An Extrapolation on the Interpolation Search.
SWAT 1988: 24-33 |
| 1987 |
|---|
| 5 | | Svante Carlsson:
Average-Case Results on Heapsort.
BIT 27(1): 2-17 (1987) |
| 4 | | Svante Carlsson:
A Variant of Heapsort with Almost Optimal Number of Comparisons.
Inf. Process. Lett. 24(4): 247-250 (1987) |
| 3 | | Svante Carlsson:
The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues.
Inf. Process. Lett. 26(1): 33-36 (1987) |
| 1986 |
|---|
| 2 | | Svante Carlsson:
Splitmerge - A Fast Stable Merging Algorithm.
Inf. Process. Lett. 22(4): 189-192 (1986) |
| 1984 |
|---|
| 1 | | Svante Carlsson:
Improving Worst-Case Behavior of Heaps.
BIT 24(1): 14-18 (1984) |
