Svante Carlsson

According to our database1, Svante Carlsson
  • authored at least 42 papers between 1984 and 2005.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2005
Worst case constant time priority queue.
Journal of Systems and Software, 2005

2002
Online Routing in Convex Subdivisions.
Int. J. Comput. Geometry Appl., 2002

2001
Worst case constant time priority queue.
Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, 2001

2000
Online Routing in Convex Subdivisions.
Proceedings of the Algorithms and Computation, 11th International Conference, 2000

1999
Finding the Shortest Watchman Route in a Simple Polygon.
Discrete & Computational Geometry, 1999

Computing Vision Points in Polygons.
Algorithmica, 1999

Resizable Arrays in Optimal Time and Space.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

1998
An optimal distributed 3-edge-connected component algorithm.
Proceedings of the SIROCCO'98, 1998

1997
Small Forwarding Tables for Fast Routing Lookups.
Proceedings of the ACM SIGCOMM 1997 Conference on Applications, 1997

A single-sex programme in computer science and engineering (poster).
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.
Theor. Comput. Sci., 1996

1995
Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time.
Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

Linear-time In-place Selection in Less than 3n Comparisons.
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Heap Construction: Optimal in Both Worst and Average Cases?
Proceedings of the Algorithms and Computation, 6th International Symposium, 1995

Searching Rigid Data Structures (Extended Abstract).
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Heaps with Bits.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Some Lower Bounds for Comparison-Based Algorithms.
Proceedings of the Algorithms, 1994

1993
Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons.
Int. J. Comput. Geometry Appl., 1993

Sublinear Merging and Natural Mergesort.
Algorithmica, 1993

Finding the Shortest Watchman Route in a Simple Polygon.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

Guarding a Treasury.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
Parallel Constructions of Heaps and Min-Max Heaps.
Parallel Processing Letters, 1992

A General Approach to Dominance in the Plane.
J. Algorithms, 1992

On Partitions and Presortedness of Sequences.
Acta Inf., 1992

In-place Linear Probing Sort.
Proceedings of the STACS 92, 1992

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

Parallel Complexity of Heaps and Min-Max Heaps.
Proceedings of the LATIN '92, 1992

1991
An Optimal Parallel Adaptive Sorting Algorithm.
Inf. Process. Lett., 1991

An Optimal Algorithm for Deleting the Root of a Heap.
Inf. Process. Lett., 1991

Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons.
Proceedings of the Algorithms and Data Structures, 1991

A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance.
Proceedings of the STACS 91, 1991

On Partitions and Presortedness of Sequences.
Proceedings of the Second Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1991

1990
Construction of a Tree From its Traversals in Optimal Time and Space.
Inf. Process. Lett., 1990

Sublinear Merging and Natural Merge Sort.
Proceedings of the Algorithms, 1990

1989
A Note on the Construction of Data Structure "DEAP".
Inf. Process. Lett., 1989

1988
An Implicit Binomial Queue with Constant Insertion Time.
Proceedings of the SWAT 88, 1988

An Extrapolation on the Interpolation Search.
Proceedings of the SWAT 88, 1988

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

A Variant of Heapsort with Almost Optimal Number of Comparisons.
Inf. Process. Lett., 1987

Average-Case Results on Heapsort.
BIT, 1987

1986
Splitmerge - A Fast Stable Merging Algorithm.
Inf. Process. Lett., 1986

1984
Improving Worst-Case Behavior of Heaps.
BIT, 1984


  Loading...