Demo Data from EDBT 2026 / reviewers in the wild / expert
Svante Carlsson
dblp:07/952
· DBLP profile ↗
31ranked-venue papers
23as first author
0since 2021 · last 2005
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 28 · 22 first-authorDatabases, data management, data science and information retrieval · 7 · 6 first-authorComputer networks · 1Software engineering, systems software and programming languages · 1Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Theoretical computer science
3 papers |
Algorithms and data structures · 76% Coding theory · 12% Computational geometry · 12% | |
| Computer networks
1 paper |
Routing and switching · 100% | |
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 100% |
Topics — the 8 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Algorithms and data structures
priority queues |
0.0 | 1 | 2001 | Worst case constant time priority queue · SODA 2001 |
Routing and switching
IP lookup |
0.0 | 1 | 1997 | Small Forwarding Tables for Fast Routing Lookups · SIGCOMM 1997 |
Routing and switching › IP lookup
longest prefix matching |
0.0 | 1 | 1997 | Small Forwarding Tables for Fast Routing Lookups · SIGCOMM 1997 |
Algorithms and data structures › analysis of algorithms
data structure complexity |
0.0 | 1 | 1992 | The Complexity of Heaps · SODA 1992 |
Algorithms and data structures › priority queues
heap |
0.0 | 1 | 1992 | The Complexity of Heaps · SODA 1992 |
Computational geometry
partitioning |
0.0 | 1 | 1991 | On Partitions and Presortedness of Sequences · SODA 1991 |
Coding theory
sequences |
0.0 | 1 | 1991 | On Partitions and Presortedness of Sequences · SODA 1991 |
Memory systems
memory-efficient data structures |
0.0 | 1 | 1997 | Small Forwarding Tables for Fast Routing Lookups · SIGCOMM 1997 |
Methods — techniques the papers use, named apart from their topics
forwarding table compaction · 0.0worst-case analysis · 0.0complexity analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2005 | Worst case constant time priority queue
Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson 0003, J. Ian Munro |
J. Syst. Softw. | 2 |
| 2001 | Worst case constant time priority queue
Andrej Brodnik, Svante Carlsson, Johan Karlsson 0003, J. Ian Munro |
SODA | 2 |
| 2000 | Online Routing in Convex Subdivisions
Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz |
ISAAC | 4 |
| 1999 | Resizable Arrays in Optimal Time and Space
Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick |
WADS | 2 |
| 1999 | Computing Vision Points in Polygons
Svante Carlsson, Bengt J. Nilsson |
Algorithmica | 1 |
| 1999 | Finding the Shortest Watchman Route in a Simple Polygon
Svante Carlsson, Håkan Jonsson 0001, Bengt J. Nilsson |
Discret. Comput. Geom. | 1 |
| 1998 | An optimal distributed 3-edge-connected component algorithm
Esther Jennings, Svante Carlsson |
SIROCCO | 2 |
| 1997 | Small Forwarding Tables for Fast Routing LookupsabstractFor some time, the networking community has assumed that it is impossible to do IP routing lookups in software fast enough to support gigabit speeds. IP routing lookups must find the routing entry with the longest matching prefix, a task that has been thought to require hardware support at lookup frequencies of millions per second.We present a forwarding table data structure designed for quick routing lookups. Forwarding tables are small enough to fit in the cache of a conventional general purpose processor. With the table in cache, a 200 MHz Pentium Pro or a 333 MHz Alpha 21164 can perform a few million lookups per second. This means that it is feasible to do a full routing lookup for each IP packet at gigabit speeds without special hardware.The forwarding tables are very small, a large routing table with 40,000 routing entries can be compacted to a forwarding table of 150-160 Kbytes. A lookup typically requires less than 100 instructions on an Alpha, using eight memory references accessing a total of 14 bytes. Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink |
SIGCOMM | 3 |
| 1996 | Heaps with Bits
Svante Carlsson, Jingsen Chen, Christer Mattsson |
Theor. Comput. Sci. | 1 |
| 1995 | Searching Rigid Data Structures (Extended Abstract)
Svante Carlsson, Jingsen Chen |
COCOON | 1 |
| 1995 | Heap Construction: Optimal in Both Worst and Average Cases?
Svante Carlsson, Jingsen Chen |
ISAAC | 1 |
| 1995 | Linear-time In-place Selection in Less than 3n Comparisons
Svante Carlsson, Mikael Sundström |
ISAAC | 1 |
| 1995 | Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time
Svante Carlsson, Håkan Jonsson 0001 |
WADS | 1 |
| 1994 | Some Lower Bounds for Comparison-Based Algorithms
Svante Carlsson, Jingsen Chen |
ESA | 1 |
| 1994 | Heaps with Bits
Svante Carlsson, Jingsen Chen, Christer Mattsson |
ISAAC | 1 |
| 1993 | Finding the Shortest Watchman Route in a Simple Polygon
Svante Carlsson, Håkan Jonsson 0001, Bengt J. Nilsson |
ISAAC | 1 |
| 1993 | Sublinear Merging and Natural Mergesort
Svante Carlsson, Christos Levcopoulos, Ola Petersson |
Algorithmica | 1 |
| 1992 | Parallel Complexity of Heaps and Min-Max Heaps
Svante Carlsson, Jingsen Chen |
LATIN | 1 |
| 1992 | The Complexity of Heaps
Svante Carlsson, Jingsen Chen |
SODA | 1 |
| 1992 | In-place Linear Probing Sort
Svante Carlsson, Jyrki Katajainen, Jukka Teuhola |
STACS | 1 |
| 1992 | On Partitions and Presortedness of Sequences
Svante Carlsson, Jingsen Chen |
Acta Informatica | 1 |
| 1991 | On Partitions and Presortedness of Sequences
Jingsen Chen, Svante Carlsson |
SODA | 2 |
| 1991 | A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance
Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson |
STACS | 1 |
| 1991 | Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons
Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos |
WADS | 1 |
| 1991 | An Optimal Algorithm for Deleting the Root of a Heap
Svante Carlsson |
Inf. Process. Lett. | 1 |
| 1991 | An Optimal Parallel Adaptive Sorting Algorithm
Svante Carlsson, Jingsen Chen |
Inf. Process. Lett. | 1 |
| 1990 | Construction of a Tree From its Traversals in Optimal Time and Space
Arne Andersson, Svante Carlsson |
Inf. Process. Lett. | 2 |
| 1989 | A Note on the Construction of Data Structure "DEAP"
Svante Carlsson, Jingsen Chen, Thomas Strothotte |
Inf. Process. Lett. | 1 |
| 1987 | A Variant of Heapsort with Almost Optimal Number of Comparisons
Svante Carlsson |
Inf. Process. Lett. | 1 |
| 1987 | The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues
Svante Carlsson |
Inf. Process. Lett. | 1 |
| 1986 | Splitmerge - A Fast Stable Merging Algorithm
Svante Carlsson |
Inf. Process. Lett. | 1 |