| 2001 | SODA | Worst case constant time priority queue. | Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro |
| 2000 | ISAAC | Online Routing in Convex Subdivisions. | Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro Lpez-Ortiz |
| 1999 | WADS | Resizable Arrays in Optimal Time and Space. | Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick |
| 1998 | SIROCCO | An optimal distributed 3-edge-connected component algorithm. | Esther Jennings, Svante Carlsson |
| 1997 | ITiCSE | A single-sex programme in computer science and engineering (poster). | Gerd Brandell, Svante Carlsson, Hkan Ekblom, Ann-Charlotte Nord |
| 1997 | SIGCOMM | Small Forwarding Tables for Fast Routing Lookups. | Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink |
| 1995 | COCOON | Searching Rigid Data Structures (Extended Abstract). | Svante Carlsson, Jingsen Chen |
| 1995 | ISAAC | Heap Construction: Optimal in Both Worst and Average Cases? | Svante Carlsson, Jingsen Chen |
| 1995 | ISAAC | Linear-time In-place Selection in Less than 3n Comparisons. | Svante Carlsson, Mikael Sundstrm |
| 1995 | WADS | Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. | Svante Carlsson, Hkan Jonsson |
| 1994 | ESA | Some Lower Bounds for Comparison-Based Algorithms. | Svante Carlsson, Jingsen Chen |
| 1994 | ISAAC | Heaps with Bits. | Svante Carlsson, Jingsen Chen, Christer Mattsson |
| 1993 | ISAAC | Finding the Shortest Watchman Route in a Simple Polygon. | Svante Carlsson, Hkan Jonsson, Bengt J. Nilsson |
| 1992 | LATIN | Parallel Complexity of Heaps and Min-Max Heaps. | Svante Carlsson, Jingsen Chen |
| 1992 | SODA | The Complexity of Heaps. | Svante Carlsson, Jingsen Chen |
| 1992 | STACS | In-place Linear Probing Sort. | Svante Carlsson, Jyrki Katajainen, Jukka Teuhola |
| 1991 | SODA | On Partitions and Presortedness of Sequences. | Jingsen Chen, Svante Carlsson |
| 1991 | STACS | A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. | Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson |
| 1991 | WADS | Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. | Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos |