Svante Carlsson

43 papers A* 5A 3B 10Misc 1Journal 19Unranked 5

Year	Rank	Type	Title / Venue / Authors
2005	J	`jnl`	Worst case constant time priority queue. J. Syst. Softw. Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
2002	J	`jnl`	Online Routing in Convex Subdivisions. Int. J. Comput. Geom. Appl. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
2001	A*	`conf`	Worst case constant time priority queue. SODA Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
2000	B	`conf`	Online Routing in Convex Subdivisions. ISAAC Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
1999	J	`jnl`	Computing Vision Points in Polygons. Algorithmica Svante Carlsson, Bengt J. Nilsson
1999	J	`jnl`	Finding the Shortest Watchman Route in a Simple Polygon. Discret. Comput. Geom. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1999	B	`conf`	Resizable Arrays in Optimal Time and Space. WADS Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
1998	B	`conf`	An optimal distributed 3-edge-connected component algorithm. SIROCCO Esther Jennings, Svante Carlsson
1997	—	`conf`	A single-sex programme in computer science and engineering (poster). ITiCSE-WGR Gerd Brandell, Svante Carlsson, Håkan Ekblom, Ann-Charlotte Nord
1997	A*	`conf`	Small Forwarding Tables for Fast Routing Lookups. SIGCOMM Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink
1996	J	`jnl`	Heaps with Bits. Theor. Comput. Sci. Svante Carlsson, Jingsen Chen, Christer Mattsson
1995	B	`conf`	Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. WADS Svante Carlsson, Håkan Jonsson
1995	B	`conf`	Heap Construction: Optimal in Both Worst and Average Cases? ISAAC Svante Carlsson, Jingsen Chen
1995	B	`conf`	Linear-time In-place Selection in Less than 3n Comparisons. ISAAC Svante Carlsson, Mikael Sundström
1995	Misc	`conf`	Searching Rigid Data Structures (Extended Abstract). COCOON Svante Carlsson, Jingsen Chen
1994	B	`conf`	Heaps with Bits. ISAAC Svante Carlsson, Jingsen Chen, Christer Mattsson
1994	A	`conf`	Some Lower Bounds for Comparison-Based Algorithms. ESA Svante Carlsson, Jingsen Chen
1993	A*	`ed.`	Automata, Languages and Programming, 20nd International Colloquium, ICALP93, Lund, Sweden, July 5-9, 1993, Proceedings ICALP Andrzej Lingas, Rolf G. Karlsson, Svante Carlsson
1993	B	`conf`	Finding the Shortest Watchman Route in a Simple Polygon. ISAAC Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
1993	—	`conf`	Guarding a Treasury. CCCG Svante Carlsson, Håkan Jonsson
1993	J	`jnl`	Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. Int. J. Comput. Geom. Appl. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
1993	J	`jnl`	Sublinear Merging and Natural Mergesort. Algorithmica Svante Carlsson, Christos Levcopoulos, Ola Petersson
1992	J	`jnl`	A General Approach to Dominance in the Plane. J. Algorithms Mark de Berg, Svante Carlsson, Mark H. Overmars
1992	A	`conf`	In-place Linear Probing Sort. STACS Svante Carlsson, Jyrki Katajainen, Jukka Teuhola
1992	J	`jnl`	On Partitions and Presortedness of Sequences. Acta Informatica Svante Carlsson, Jingsen Chen
1992	B	`conf`	Parallel Complexity of Heaps and Min-Max Heaps. LATIN Svante Carlsson, Jingsen Chen
1992	J	`jnl`	Parallel Constructions of Heaps and Min-Max Heaps. Parallel Process. Lett. Svante Carlsson, Jingsen Chen
1992	A*	`conf`	The Complexity of Heaps. SODA Svante Carlsson, Jingsen Chen
1991	A	`conf`	A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. STACS Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
1991	J	`jnl`	An Optimal Algorithm for Deleting the Root of a Heap. Inf. Process. Lett. Svante Carlsson
1991	J	`jnl`	An Optimal Parallel Adaptive Sorting Algorithm. Inf. Process. Lett. Svante Carlsson, Jingsen Chen
1991	A*	`conf`	On Partitions and Presortedness of Sequences. SODA Jingsen Chen, Svante Carlsson
1991	B	`conf`	Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. WADS Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
1990	J	`jnl`	Construction of a Tree From its Traversals in Optimal Time and Space. Inf. Process. Lett. Arne Andersson, Svante Carlsson
1990	—	`conf`	Sublinear Merging and Natural Merge Sort. SIGAL International Symposium on Algorithms Svante Carlsson, Christos Levcopoulos, Ola Petersson
1989	J	`jnl`	A Note on the Construction of Data Structure "DEAP". Inf. Process. Lett. Svante Carlsson, Jingsen Chen, Thomas Strothotte
1988	—	`conf`	An Extrapolation on the Interpolation Search. SWAT Svante Carlsson, Christer Mattsson
1988	—	`conf`	An Implicit Binomial Queue with Constant Insertion Time. SWAT Svante Carlsson, J. Ian Munro, Patricio V. Poblete
1987	J	`jnl`	A Variant of Heapsort with Almost Optimal Number of Comparisons. Inf. Process. Lett. Svante Carlsson
1987	J	`jnl`	Average-Case Results on Heapsort. BIT Svante Carlsson
1987	J	`jnl`	The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. Inf. Process. Lett. Svante Carlsson
1986	J	`jnl`	Splitmerge - A Fast Stable Merging Algorithm. Inf. Process. Lett. Svante Carlsson
1984	J	`jnl`	Improving Worst-Case Behavior of Heaps. BIT Svante Carlsson