Svante Carlsson - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 42 from 42

2005

Worst case constant time priority queueAndrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro. jss, 78(3):249-256, 2005. [doi]

2002

Online Routing in Convex SubdivisionsProsenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro. ijcga, 12(4):283-296, 2002. [doi]

2001

Worst case constant time priority queueAndrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro. soda 2001: 523-528 [doi]

2000

Online Routing in Convex SubdivisionsProsenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz. isaac 2000: 47-59 [doi]

1999

Resizable Arrays in Optimal Time and SpaceAndrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick. wads 1999: 37-48 [doi]

Finding the Shortest Watchman Route in a Simple PolygonSvante Carlsson, Håkan Jonsson, Bengt J. Nilsson. dcg, 22(3):377-402, 1999. [doi]

Computing Vision Points in PolygonsSvante Carlsson, Bengt J. Nilsson. algorithmica, 24(1):50-75, 1999. [doi]

1998

An optimal distributed 3-edge-connected component algorithmEsther Jennings, Svante Carlsson. sirocco 1998: 129-144

1997

A single-sex programme in computer science and engineering (poster)Gerd Brandell, Svante Carlsson, Håkan Ekblom, Ann-Charlotte Nord. iticse 1997: 146 [doi]

Small Forwarding Tables for Fast Routing LookupsMikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink. sigcomm 1997: 3-14 [doi]

1996

Heaps with BitsSvante Carlsson, Jingsen Chen, Christer Mattsson. TCS, 164(1&2):1-12, 1996. [doi]

1995

Searching Rigid Data Structures (Extended Abstract)Svante Carlsson, Jingsen Chen. cocoon 1995: 446-451

Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-TimeSvante Carlsson, Håkan Jonsson. wads 1995: 122-134

Heap Construction: Optimal in Both Worst and Average Cases?Svante Carlsson, Jingsen Chen. isaac 1995: 254-263

Linear-time In-place Selection in Less than 3n ComparisonsSvante Carlsson, Mikael Sundström. isaac 1995: 244-253

1994

Heaps with BitsSvante Carlsson, Jingsen Chen, Christer Mattsson. isaac 1994: 288-296

Some Lower Bounds for Comparison-Based AlgorithmsSvante Carlsson, Jingsen Chen. esa 1994: 106-117

1993

Guarding a TreasurySvante Carlsson, Håkan Jonsson. cccg 1993: 85-90

Sublinear Merging and Natural MergesortSvante Carlsson, Christos Levcopoulos, Ola Petersson. algorithmica, 9(6):629-648, 1993.

Finding the Shortest Watchman Route in a Simple PolygonSvante Carlsson, Håkan Jonsson, Bengt J. Nilsson. isaac 1993: 58-67

Optimum Guard Covers and m -Watchmen Routes for Restricted PolygonsSvante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos. ijcga, 3(1):85-105, 1993.

1992

Parallel Constructions of Heaps and Min-Max HeapsSvante Carlsson, Jingsen Chen. ppl, 2:311-320, 1992.

On Partitions and Presortedness of SequencesSvante Carlsson, Jingsen Chen. ACTA, 29(3):267-280, 1992.

Parallel Complexity of Heaps and Min-Max HeapsSvante Carlsson, Jingsen Chen. latin 1992: 108-116

In-place Linear Probing SortSvante Carlsson, Jyrki Katajainen, Jukka Teuhola. STACS 1992: 581-587

The Complexity of HeapsSvante Carlsson, Jingsen Chen. soda 1992: 393-402 [doi]

A General Approach to Dominance in the PlaneMark de Berg, Svante Carlsson, Mark H. Overmars. jal, 13(2):274-296, 1992.

1991

1990

Construction of a Tree From its Traversals in Optimal Time and SpaceArne Andersson, Svante Carlsson. ipl, 34(1):21-25, 1990.

Sublinear Merging and Natural Merge SortSvante Carlsson, Christos Levcopoulos, Ola Petersson. sigal 1990: 251-260

1989

A Note on the Construction of Data Structure DEAP Svante Carlsson, Jingsen Chen, Thomas Strothotte. ipl, 31(6):315-317, 1989.

1988

An Extrapolation on the Interpolation SearchSvante Carlsson, Christer Mattsson. swat 1988: 24-33

An Implicit Binomial Queue with Constant Insertion TimeSvante Carlsson, J. Ian Munro, Patricio V. Poblete. swat 1988: 1-13

1987

Average-Case Results on HeapsortSvante Carlsson. bit, 27(1):2-17, 1987.

The Deap-A Double-Ended Heap to Implement Double-Ended Priority QueuesSvante Carlsson. ipl, 26(1):33-36, 1987.

A Variant of Heapsort with Almost Optimal Number of ComparisonsSvante Carlsson. ipl, 24(4):247-250, 1987.

1986

Splitmerge - A Fast Stable Merging AlgorithmSvante Carlsson. ipl, 22(4):189-192, 1986.

1984

Improving Worst-Case Behavior of HeapsSvante Carlsson. bit, 24(1):14-18, 1984.

Sign in or sign up to see more results.

runs on WebDSL