Svante Carlsson

According to our database, Svante Carlsson authored at least 37 papers between 1984 and 2005.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2005

Worst case constant time priority queue.

Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro

J. Syst. Softw., 2005

2002

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

2001

Worst case constant time priority queue.

Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro

Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

1999

Finding the Shortest Watchman Route in a Simple Polygon.

Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson

Discret. Comput. Geom., 1999

Computing Vision Points in Polygons.

Svante Carlsson, Bengt J. Nilsson

Algorithmica, 1999

Resizable Arrays in Optimal Time and Space.

Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick

Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998

An optimal distributed 3-edge-connected component algorithm.

Esther Jennings, Svante Carlsson

Proceedings of the SIROCCO'98, 1998

1997

Small Forwarding Tables for Fast Routing Lookups.

Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink

Proceedings of the ACM SIGCOMM 1997 Conference on Applications, 1997

A single-sex programme in computer science and engineering (poster).

Gerd Brandell, Svante Carlsson, Håkan Ekblom, Ann-Charlotte Nord

Proceedings of the supplemental proceedings of the conference on Integrating technology into computer science education: working group reports and supplemental proceedings, 1997

1996

Heaps with Bits.

Svante Carlsson, Jingsen Chen, Christer Mattsson

Theor. Comput. Sci., 1996

1995

Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.

Svante Carlsson, Håkan Jonsson

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Linear-time In-place Selection in Less than 3n Comparisons.

Svante Carlsson, Mikael Sundström

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Heap Construction: Optimal in Both Worst and Average Cases?

Svante Carlsson, Jingsen Chen

Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Searching Rigid Data Structures (Extended Abstract).

Svante Carlsson, Jingsen Chen

Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994

Some Lower Bounds for Comparison-Based Algorithms.

Svante Carlsson, Jingsen Chen

Proceedings of the Algorithms, 1994

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

Sublinear Merging and Natural Mergesort.

Svante Carlsson, Christos Levcopoulos, Ola Petersson

Algorithmica, 1993

Guarding a Treasury.

Svante Carlsson, Håkan Jonsson

Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992

Parallel Constructions of Heaps and Min-Max Heaps.

Svante Carlsson, Jingsen Chen

Parallel Process. Lett., 1992

A General Approach to Dominance in the Plane.

Mark de Berg, Svante Carlsson, Mark H. Overmars

J. Algorithms, 1992

On Partitions and Presortedness of Sequences.

Svante Carlsson, Jingsen Chen

Acta Informatica, 1992

In-place Linear Probing Sort.

Svante Carlsson, Jyrki Katajainen, Jukka Teuhola

Proceedings of the STACS 92, 1992

The Complexity of Heaps.

Svante Carlsson, Jingsen Chen

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

Parallel Complexity of Heaps and Min-Max Heaps.

Svante Carlsson, Jingsen Chen

Proceedings of the LATIN '92, 1992

1991

An Optimal Parallel Adaptive Sorting Algorithm.

Svante Carlsson, Jingsen Chen

Inf. Process. Lett., 1991

An Optimal Algorithm for Deleting the Root of a Heap.

Svante Carlsson

Inf. Process. Lett., 1991

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.

Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson

Proceedings of the STACS 91, 1991

1990

Construction of a Tree From its Traversals in Optimal Time and Space.

Arne Andersson, Svante Carlsson

Inf. Process. Lett., 1990

Sublinear Merging and Natural Merge Sort.

Svante Carlsson, Christos Levcopoulos, Ola Petersson

Proceedings of the Algorithms, 1990

1989

A Note on the Construction of Data Structure "DEAP".

Svante Carlsson, Jingsen Chen, Thomas Strothotte

Inf. Process. Lett., 1989

1988

An Implicit Binomial Queue with Constant Insertion Time.

Svante Carlsson, J. Ian Munro, Patricio V. Poblete

Proceedings of the SWAT 88, 1988

An Extrapolation on the Interpolation Search.

Svante Carlsson, Christer Mattsson

Proceedings of the SWAT 88, 1988

1987

The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues.

Svante Carlsson

Inf. Process. Lett., 1987

A Variant of Heapsort with Almost Optimal Number of Comparisons.

Svante Carlsson

Inf. Process. Lett., 1987

Average-Case Results on Heapsort.

Svante Carlsson

BIT, 1987

1986

Splitmerge - A Fast Stable Merging Algorithm.

Svante Carlsson

Inf. Process. Lett., 1986

1984

Improving Worst-Case Behavior of Heaps.

Svante Carlsson

BIT, 1984