Improving Worst-Case Behavior of Heaps. - Svante Carlsson (BIT, 1984)

Splitmerge - A Fast Stable Merging Algorithm. - Svante Carlsson (Inf. Process. Lett., 1986)

Average-Case Results on Heapsort. - Svante Carlsson (BIT, 1987)

A Variant of Heapsort with Almost Optimal Number of Comparisons. - Svante Carlsson (Inf. Process. Lett., 1987)

The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. - Svante Carlsson (Inf. Process. Lett., 1987)

An Extrapolation on the Interpolation Search. - Svante Carlsson; Christer Mattsson (SWAT, 1988)

An Implicit Binomial Queue with Constant Insertion Time. - Svante Carlsson; J. Ian Munro; Patricio V. Poblete (SWAT, 1988)

A Note on the Construction of Data Structure "DEAP". - Svante Carlsson; Jingsen Chen; Thomas Strothotte (Inf. Process. Lett., 1989)

Sublinear Merging and Natural Merge Sort. - Svante Carlsson; Christos Levcopoulos; Ola Petersson (SIGAL International Symposium on Algorithms, 1990)

Construction of a Tree From its Traversals in Optimal Time and Space. - Arne Andersson; Svante Carlsson (Inf. Process. Lett., 1990)

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. - Svante Carlsson; Christer Mattsson; Patricio V. Poblete; Mats Bengtsson (STACS, 1991)

An Optimal Algorithm for Deleting the Root of a Heap. - Svante Carlsson (Inf. Process. Lett., 1991)

An Optimal Parallel Adaptive Sorting Algorithm. - Svante Carlsson; Jingsen Chen (Inf. Process. Lett., 1991)

Parallel Complexity of Heaps and Min-Max Heaps. - Svante Carlsson; Jingsen Chen (LATIN, 1992)

The Complexity of Heaps. - Svante Carlsson; Jingsen Chen (SODA, 1992)

In-place Linear Probing Sort. - Svante Carlsson; Jyrki Katajainen; Jukka Teuhola (STACS, 1992)

On Partitions and Presortedness of Sequences. - Svante Carlsson; Jingsen Chen (Acta Informatica, 1992)

A General Approach to Dominance in the Plane. - Mark de Berg; Svante Carlsson; Mark H. Overmars (J. Algorithms, 1992)

Parallel Constructions of Heaps and Min-Max Heaps. - Svante Carlsson; Jingsen Chen (Parallel Process. Lett., 1992)

Guarding a Treasury. - Svante Carlsson; Håkan Jonsson 001 (CCCG, 1993)

Sublinear Merging and Natural Mergesort. - Svante Carlsson; Christos Levcopoulos; Ola Petersson (Algorithmica, 1993)

Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. - Svante Carlsson; Bengt J. Nilsson; Simeon C. Ntafos (Int. J. Comput. Geom. Appl., 1993)

Some Lower Bounds for Comparison-Based Algorithms. - Svante Carlsson; Jingsen Chen (ESA, 1994)

Searching Rigid Data Structures (Extended Abstract). - Svante Carlsson; Jingsen Chen (COCOON, 1995)

Heap Construction: Optimal in Both Worst and Average Cases? - Svante Carlsson; Jingsen Chen (ISAAC, 1995)

Linear-time In-place Selection in Less than 3n Comparisons. - Svante Carlsson; Mikael Sundström (ISAAC, 1995)

Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. - Svante Carlsson; Håkan Jonsson 001 (WADS, 1995)

Heaps with Bits. - Svante Carlsson; Jingsen Chen; Christer Mattsson (Theor. Comput. Sci., 1996)

A single-sex programme in computer science and engineering (poster). - Gerd Brandell; Svante Carlsson; Håkan Ekblom; Ann-Charlotte Nord (ITiCSE-WGR, 1997)

Small Forwarding Tables for Fast Routing Lookups. - Mikael Degermark; Andrej Brodnik; Svante Carlsson; Stephen Pink (SIGCOMM, 1997)

An optimal distributed 3-edge-connected component algorithm. - Esther Jennings; Svante Carlsson (SIROCCO, 1998)

Resizable Arrays in Optimal Time and Space. - Andrej Brodnik; Svante Carlsson; Erik D. Demaine; J. Ian Munro; Robert Sedgewick (WADS, 1999)

Computing Vision Points in Polygons. - Svante Carlsson; Bengt J. Nilsson (Algorithmica, 1999)

Finding the Shortest Watchman Route in a Simple Polygon. - Svante Carlsson; Håkan Jonsson 001; Bengt J. Nilsson (Discret. Comput. Geom., 1999)

Worst case constant time priority queue. - Andrej Brodnik; Svante Carlsson; Johan Karlsson 003; J. Ian Munro (SODA, 2001)

Online Routing in Convex Subdivisions. - Prosenjit Bose; Andrej Brodnik; Svante Carlsson; Erik D. Demaine; Rudolf Fleischer; Alejandro López-Ortiz; Pat Morin; J. Ian Munro (Int. J. Comput. Geom. Appl., 2002)

Worst case constant time priority queue. - Andrej Brodnik; Svante Carlsson; Michael L. Fredman; Johan Karlsson 003; J. Ian Munro (J. Syst. Softw., 2005)