Svante Carlsson

1.7k total citations · 1 hit paper
30 papers, 943 citations indexed

About

Svante Carlsson is a scholar working on Artificial Intelligence, Computer Networks and Communications and Computational Theory and Mathematics. According to data from OpenAlex, Svante Carlsson has authored 30 papers receiving a total of 943 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Artificial Intelligence, 9 papers in Computer Networks and Communications and 9 papers in Computational Theory and Mathematics. Recurrent topics in Svante Carlsson's work include Algorithms and Data Compression (11 papers), semigroups and automata theory (6 papers) and Computational Geometry and Mesh Generation (4 papers). Svante Carlsson is often cited by papers focused on Algorithms and Data Compression (11 papers), semigroups and automata theory (6 papers) and Computational Geometry and Mesh Generation (4 papers). Svante Carlsson collaborates with scholars based in Sweden, Slovenia and Canada. Svante Carlsson's co-authors include Andrej Brodnik, Mikael Degermark, Stephen Pink, Bengt J. Nilsson, Pushpendra Kumar Jain, N. Nijegorodov, K. Devan, Håkan Jönsson, Simeon Ntafos and J. Ian Munro and has published in prestigious journals such as Renewable Energy, ACM SIGCOMM Computer Communication Review and Theoretical Computer Science.

In The Last Decade

Svante Carlsson

29 papers receiving 865 citations

Hit Papers

Small forwarding tables for fast routing lookups 1997 2026 2006 2016 1997 100 200 300 400
What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

  1. Small forwarding tables for fast routing lookups
    1997 447 citations Andrej Brodnik, Svante Carlsson et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Svante Carlsson Sweden 11 642 570 408 83 82 30 943
Ping Huang China 18 671 1.0× 235 0.4× 143 0.4× 85 1.0× 44 0.5× 109 1.1k
Vijay Nagarajan United Kingdom 20 969 1.5× 943 1.7× 148 0.4× 246 3.0× 20 0.2× 73 1.2k
Roger Haskin United States 13 1.2k 1.9× 419 0.7× 212 0.5× 21 0.3× 27 0.3× 26 1.3k
V. Nageshwara Rao United States 8 278 0.4× 160 0.3× 214 0.5× 36 0.4× 47 0.6× 12 441
Derek Lieber United States 12 318 0.5× 361 0.6× 159 0.4× 15 0.2× 47 0.6× 20 534
Howard Trickey United States 11 337 0.5× 177 0.3× 115 0.3× 108 1.3× 48 0.6× 20 547
Alexandros V. Gerbessiotis United States 9 280 0.4× 222 0.4× 126 0.3× 33 0.4× 61 0.7× 31 403
Wei‐Chung Hsu Taiwan 18 763 1.2× 992 1.7× 236 0.6× 160 1.9× 49 0.6× 123 1.1k
Peter Varman United States 19 1.1k 1.8× 509 0.9× 115 0.3× 293 3.5× 70 0.9× 100 1.4k
Prabhakar Ragde Canada 17 259 0.4× 88 0.2× 264 0.6× 44 0.5× 411 5.0× 37 623

Countries citing papers authored by Svante Carlsson

Since Specialization
Citations

This map shows the geographic impact of Svante Carlsson's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Svante Carlsson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Svante Carlsson more than expected).

Fields of papers citing papers by Svante Carlsson

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Svante Carlsson. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Svante Carlsson. The network helps show where Svante Carlsson may publish in the future.

Co-authorship network of co-authors of Svante Carlsson

This figure shows the co-authorship network connecting the top 25 collaborators of Svante Carlsson. A scholar is included among the top collaborators of Svante Carlsson based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Svante Carlsson. Svante Carlsson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Bose, Prosenjit, Andrej Brodnik, Svante Carlsson, et al.. (2002). ONLINE ROUTING IN CONVEX SUBDIVISIONS. International Journal of Computational Geometry & Applications. 12(4). 283–295. 21 indexed citations
2.
Brodnik, Andrej, Svante Carlsson, Johan Karlsson, & J. Ian Munro. (2001). Worst case constant time priority queue. Symposium on Discrete Algorithms. 523–528. 7 indexed citations
3.
Carlsson, Svante, Håkan Jönsson, & Bengt J. Nilsson. (1999). Finding the Shortest Watchman Route in a Simple Polygon. Discrete & Computational Geometry. 22(3). 377–402. 43 indexed citations
4.
Carlsson, Svante & Bengt J. Nilsson. (1999). Computing Vision Points in Polygons. Algorithmica. 24(1). 50–75. 13 indexed citations
5.
Carlsson, Svante, et al.. (1996). Heaps with bits. Theoretical Computer Science. 164(1-2). 1–12. 5 indexed citations
6.
Nijegorodov, N., K. Devan, Pushpendra Kumar Jain, & Svante Carlsson. (1994). Atmospheric transmittance models and an analytical method to predict the optimum slope of an absorber plate, variously oriented at any latitude. Renewable Energy. 4(5). 529–543. 85 indexed citations
7.
Lingas, Andrzej, Rickard Karlsson, & Svante Carlsson. (1993). Automata, Languages and Programming 20th International Colloquium, Icalp 93, Lund, Sweden, July 5-9, 1993 : Proceedings. Springer eBooks. 1 indexed citations
8.
Carlsson, Svante & Håkan Jönsson. (1993). Guarding a Treasury.. Canadian Conference on Computational Geometry. 85–90. 3 indexed citations
9.
Carlsson, Svante, Bengt J. Nilsson, & Simeon Ntafos. (1993). OPTIMUM GUARD COVERS AND m-WATCHMEN ROUTES FOR RESTRICTED POLYGONS. International Journal of Computational Geometry & Applications. 3(1). 85–105. 19 indexed citations
10.
Carlsson, Svante, Christos Levcopoulos, & Ola Petersson. (1993). Sublinear merging and natural mergesort. Algorithmica. 9(6). 629–648. 7 indexed citations
11.
Lingas, Andrzej, et al.. (1993). Proceedings of the 20th International Colloquium on Automata, Languages and Programming. 2 indexed citations
12.
Carlsson, Svante, et al.. (1992). The complexity of heaps. Symposium on Discrete Algorithms. 393–402. 5 indexed citations
13.
Berg, Mark de, Svante Carlsson, & Mark H. Overmars. (1992). A general approach to dominance in the plane. Journal of Algorithms. 13(2). 274–296. 7 indexed citations
14.
Carlsson, Svante, et al.. (1992). On partitions and presortedness of sequences. Acta Informatica. 29(3). 267–280. 3 indexed citations
15.
Carlsson, Svante, et al.. (1992). PARALLEL CONSTRUCTIONS OF HEAPS AND MIN-MAX HEAPS. Parallel Processing Letters. 2(4). 311–320. 1 indexed citations
16.
Carlsson, Svante, et al.. (1991). On partitions and presortedness of sequences. 62–71. 5 indexed citations
17.
Carlsson, Svante, et al.. (1991). An optimal parallel adaptive sorting algorithm. Information Processing Letters. 39(4). 195–200. 5 indexed citations
18.
Carlsson, Svante, et al.. (1989). A note on the construction of the data structure “deap”. Information Processing Letters. 31(6). 315–317. 5 indexed citations
19.
Carlsson, Svante. (1987). A variant of heapsort with almost optimal number of comparisons. Information Processing Letters. 24(4). 247–250. 26 indexed citations
20.
Carlsson, Svante. (1986). Splitmerge—A fast stable merging algorithm. Information Processing Letters. 22(4). 189–192. 2 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by Ping Huang Breakdown of academic impact, for papers by Vijay Nagarajan Breakdown of academic impact, for papers by Roger Haskin Breakdown of academic impact, for papers by V. Nageshwara Rao Breakdown of academic impact, for papers by Derek Lieber Breakdown of academic impact, for papers by Howard Trickey Breakdown of academic impact, for papers by Alexandros V. Gerbessiotis Breakdown of academic impact, for papers by Wei‐Chung Hsu Breakdown of academic impact, for papers by Peter Varman Breakdown of academic impact, for papers by Prabhakar Ragde
Rankless by CCL
2026