The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Svante Carlsson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Svante Carlsson, Håkan Jonsson
    Guarding a Treasury. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:85-90 [Conf]
  2. Svante Carlsson, Jingsen Chen
    Searching Rigid Data Structures (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:446-451 [Conf]
  3. Svante Carlsson, Jingsen Chen
    Some Lower Bounds for Comparison-Based Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 1994, pp:106-117 [Conf]
  4. Prosenjit Bose, Pat Morin, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, J. Ian Munro, Alejandro López-Ortiz
    Online Routing in Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2000, pp:47-59 [Conf]
  5. Svante Carlsson, Jingsen Chen
    Heap Construction: Optimal in Both Worst and Average Cases? [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:254-263 [Conf]
  6. Svante Carlsson, Jingsen Chen, Christer Mattsson
    Heaps with Bits. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:288-296 [Conf]
  7. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Finding the Shortest Watchman Route in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1993, pp:58-67 [Conf]
  8. Svante Carlsson, Mikael Sundström
    Linear-time In-place Selection in Less than 3n Comparisons. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1995, pp:244-253 [Conf]
  9. Svante Carlsson, Jingsen Chen
    Parallel Complexity of Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:108-116 [Conf]
  10. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Merge Sort. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:251-260 [Conf]
  11. Mikael Degermark, Andrej Brodnik, Svante Carlsson, Stephen Pink
    Small Forwarding Tables for Fast Routing Lookups. [Citation Graph (0, 0)][DBLP]
    SIGCOMM, 1997, pp:3-14 [Conf]
  12. Esther Jennings, Svante Carlsson
    An optimal distributed 3-edge-connected component algorithm. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1998, pp:129-144 [Conf]
  13. Andrej Brodnik, Svante Carlsson, Johan Karlsson, J. Ian Munro
    Worst case constant time priority queue. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:523-528 [Conf]
  14. Svante Carlsson, Jingsen Chen
    The Complexity of Heaps. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:393-402 [Conf]
  15. Jingsen Chen, Svante Carlsson
    On Partitions and Presortedness of Sequences. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:62-71 [Conf]
  16. Svante Carlsson, Jyrki Katajainen, Jukka Teuhola
    In-place Linear Probing Sort. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:581-587 [Conf]
  17. Svante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson
    A New Compacting Garbage-Collection Algorithm with a Good Average-Case Performance. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:296-308 [Conf]
  18. Svante Carlsson, Christer Mattsson
    An Extrapolation on the Interpolation Search. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:24-33 [Conf]
  19. Svante Carlsson, J. Ian Munro, Patricio V. Poblete
    An Implicit Binomial Queue with Constant Insertion Time. [Citation Graph (0, 0)][DBLP]
    SWAT, 1988, pp:1-13 [Conf]
  20. Andrej Brodnik, Svante Carlsson, Erik D. Demaine, J. Ian Munro, Robert Sedgewick
    Resizable Arrays in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:37-48 [Conf]
  21. Svante Carlsson, Håkan Jonsson
    Computing a Shortest Watchman Path in a Simple Polygon in Polynomial-Time. [Citation Graph (0, 0)][DBLP]
    WADS, 1995, pp:122-134 [Conf]
  22. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
    Optimum Guard Covers and m-Watchmen Routes for Restricted Polygons. [Citation Graph (0, 0)][DBLP]
    WADS, 1991, pp:367-378 [Conf]
  23. Svante Carlsson, Jingsen Chen
    On Partitions and Presortedness of Sequences. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1992, v:29, n:3, pp:267-280 [Journal]
  24. Svante Carlsson, Christos Levcopoulos, Ola Petersson
    Sublinear Merging and Natural Mergesort. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:629-648 [Journal]
  25. Svante Carlsson, Bengt J. Nilsson
    Computing Vision Points in Polygons. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:24, n:1, pp:50-75 [Journal]
  26. Svante Carlsson
    Improving Worst-Case Behavior of Heaps. [Citation Graph (0, 0)][DBLP]
    BIT, 1984, v:24, n:1, pp:14-18 [Journal]
  27. Svante Carlsson
    Average-Case Results on Heapsort. [Citation Graph (0, 0)][DBLP]
    BIT, 1987, v:27, n:1, pp:2-17 [Journal]
  28. Svante Carlsson, Håkan Jonsson, Bengt J. Nilsson
    Finding the Shortest Watchman Route in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1999, v:22, n:3, pp:377-402 [Journal]
  29. Prosenjit Bose, Andrej Brodnik, Svante Carlsson, Erik D. Demaine, Rudolf Fleischer, Alejandro López-Ortiz, Pat Morin, J. Ian Munro
    Online Routing in Convex Subdivisions. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2002, v:12, n:4, pp:283-296 [Journal]
  30. Svante Carlsson, Bengt J. Nilsson, Simeon C. Ntafos
    Optimum Guard Covers and $m$-Watchmen Routes for Restricted Polygons. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1993, v:3, n:1, pp:85-105 [Journal]
  31. Arne Andersson, Svante Carlsson
    Construction of a Tree From its Traversals in Optimal Time and Space. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1990, v:34, n:1, pp:21-25 [Journal]
  32. Svante Carlsson
    Splitmerge - A Fast Stable Merging Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:22, n:4, pp:189-192 [Journal]
  33. Svante Carlsson
    A Variant of Heapsort with Almost Optimal Number of Comparisons. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:24, n:4, pp:247-250 [Journal]
  34. Svante Carlsson
    The Deap-A Double-Ended Heap to Implement Double-Ended Priority Queues. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1987, v:26, n:1, pp:33-36 [Journal]
  35. Svante Carlsson
    An Optimal Algorithm for Deleting the Root of a Heap. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:37, n:2, pp:117-120 [Journal]
  36. Svante Carlsson, Jingsen Chen
    An Optimal Parallel Adaptive Sorting Algorithm. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:4, pp:195-200 [Journal]
  37. Svante Carlsson, Jingsen Chen, Thomas Strothotte
    A Note on the Construction of Data Structure ``DEAP''. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1989, v:31, n:6, pp:315-317 [Journal]
  38. Mark de Berg, Svante Carlsson, Mark H. Overmars
    A General Approach to Dominance in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:274-296 [Journal]
  39. Andrej Brodnik, Svante Carlsson, Michael L. Fredman, Johan Karlsson, J. Ian Munro
    Worst case constant time priority queue. [Citation Graph (0, 0)][DBLP]
    Journal of Systems and Software, 2005, v:78, n:3, pp:249-256 [Journal]
  40. Svante Carlsson, Jingsen Chen
    Parallel Constructions of Heaps and Min-Max Heaps. [Citation Graph (0, 0)][DBLP]
    Parallel Processing Letters, 1992, v:2, n:, pp:311-320 [Journal]
  41. Svante Carlsson, Jingsen Chen, Christer Mattsson
    Heaps with Bits. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:164, n:1&2, pp:1-12 [Journal]

Search in 0.029secs, Finished in 0.030secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002