Stephen Alstrup

1.8k total citations
43 papers, 604 citations indexed

About

Stephen Alstrup is a scholar working on Computational Theory and Mathematics, Artificial Intelligence and Computer Networks and Communications. According to data from OpenAlex, Stephen Alstrup has authored 43 papers receiving a total of 604 indexed citations (citations by other indexed papers that have themselves been cited), including 24 papers in Computational Theory and Mathematics, 17 papers in Artificial Intelligence and 15 papers in Computer Networks and Communications. Recurrent topics in Stephen Alstrup's work include Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (17 papers) and Algorithms and Data Compression (12 papers). Stephen Alstrup is often cited by papers focused on Advanced Graph Theory Research (17 papers), Complexity and Algorithms in Graphs (17 papers) and Algorithms and Data Compression (12 papers). Stephen Alstrup collaborates with scholars based in Denmark, Israel and United States. Stephen Alstrup's co-authors include Theis Rauhe, Mikkel Thorup, Gerth Stølting Brodal, Thore Husfeldt, Dov Harel, Haim Kaplan, Jacob Holm, Kristian de Lichtenberg, Cyril Gavoille and Christian Igel and has published in prestigious journals such as Journal of the ACM, SIAM Journal on Computing and Theoretical Computer Science.

In The Last Decade

Stephen Alstrup

39 papers receiving 559 citations

Peers — A (Enhanced Table)

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

Name h Career Trend Papers Cites
Stephen Alstrup Denmark 14 300 281 194 104 94 43 604
Adam L. Buchsbaum United States 14 202 0.7× 333 1.2× 296 1.5× 96 0.9× 72 0.8× 41 623
Jeffery Westbrook United States 17 356 1.2× 223 0.8× 479 2.5× 61 0.6× 50 0.5× 34 766
Prabhakar Ragde Canada 17 411 1.4× 264 0.9× 259 1.3× 41 0.4× 88 0.9× 37 623
Eljas Soisalon-Soininen Finland 13 162 0.5× 283 1.0× 286 1.5× 108 1.0× 78 0.8× 70 624
Martin Dietzfelbinger Germany 13 259 0.9× 369 1.3× 302 1.6× 35 0.3× 93 1.0× 56 629
Irene Finocchi Italy 15 131 0.4× 186 0.7× 323 1.7× 75 0.7× 127 1.4× 63 658
Rüdiger Reischuk Germany 10 396 1.3× 372 1.3× 326 1.7× 18 0.2× 83 0.9× 53 723
Oren Weimann Israel 11 177 0.6× 234 0.8× 131 0.7× 62 0.6× 45 0.5× 40 423
Faith E. Fich Canada 15 373 1.2× 419 1.5× 359 1.9× 34 0.3× 229 2.4× 51 802
Moshe Lewenstein Israel 19 494 1.6× 604 2.1× 188 1.0× 72 0.7× 197 2.1× 64 1.0k

Countries citing papers authored by Stephen Alstrup

Since Specialization
Citations

This map shows the geographic impact of Stephen Alstrup'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 Stephen Alstrup with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stephen Alstrup more than expected).

Fields of papers citing papers by Stephen Alstrup

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Stephen Alstrup. 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 Stephen Alstrup. The network helps show where Stephen Alstrup may publish in the future.

Co-authorship network of co-authors of Stephen Alstrup

This figure shows the co-authorship network connecting the top 25 collaborators of Stephen Alstrup. A scholar is included among the top collaborators of Stephen Alstrup 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 Stephen Alstrup. Stephen Alstrup 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.
Alstrup, Stephen, et al.. (2019). Near-optimal induced universal graphs for cycles and paths. Discrete Applied Mathematics. 282. 1–13.
2.
Hansen, Casper Worm, Christian Hansen, Stephen Alstrup, Jakob Grue Simonsen, & Christina Lioma. (2019). Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking. Research at the University of Copenhagen (University of Copenhagen). 994–1000. 13 indexed citations
3.
Alstrup, Stephen, et al.. (2017). DABAI:A data driven project for e-Learning in Denmark. Research at the University of Copenhagen (University of Copenhagen). 1 indexed citations
4.
Alstrup, Stephen, et al.. (2017). Near-Optimal Induced Universal Graphs for Bounded Degree Graphs. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 1 indexed citations
5.
Alstrup, Stephen, et al.. (2016). Sublinear Distance Labeling. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 57. 15. 2 indexed citations
6.
Alstrup, Stephen, et al.. (2016). Distance labeling schemes for trees. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics). 16. 1 indexed citations
7.
Alstrup, Stephen, et al.. (2016). Possibilities and barriers for e-learning in primary school in Denmark. Research at the University of Copenhagen (University of Copenhagen). 2 indexed citations
8.
Igel, Christian, et al.. (2015). High-School Dropout Prediction Using Machine Learning: A Danish Large-scale Study.. Research at the University of Copenhagen (University of Copenhagen). 35 indexed citations
9.
Abiteboul, Serge, Stephen Alstrup, Haim Kaplan, Tova Milo, & Theis Rauhe. (2006). Compact Labeling Scheme for Ancestor Queries. SIAM Journal on Computing. 35(6). 1295–1309. 26 indexed citations
10.
Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (2005). Maintaining information in fully dynamic trees with top trees. ACM Transactions on Algorithms. 1(2). 243–264. 49 indexed citations
11.
Alstrup, Stephen, Philip Bille, & Theis Rauhe. (2003). Labeling schemes for small distances in trees. Symposium on Discrete Algorithms. 689–698. 14 indexed citations
12.
Alstrup, Stephen & Theis Rauhe. (2002). Improved labeling scheme for ancestor queries. Symposium on Discrete Algorithms. 947–953. 40 indexed citations
13.
Alstrup, Stephen, Cyril Gavoille, Haim Kaplan, & Theis Rauhe. (2002). Nearest common ancestors. 1 indexed citations
14.
Alstrup, Stephen, Gerth Stølting Brodal, & Theis Rauhe. (2002). New data structures for orthogonal range searching. 198–207. 65 indexed citations
15.
Alstrup, Stephen, Thore Husfeldt, & Theis Rauhe. (2002). Marked ancestor problems. 534–543. 47 indexed citations
16.
Alstrup, Stephen, Thore Husfeldt, & Theis Rauhe. (2001). A cell probe lower bound for dynamic nearest-neighbor searching. Symposium on Discrete Algorithms. 779–780. 2 indexed citations
17.
Alstrup, Stephen, Gerth Stølting Brodal, & Theis Rauhe. (2000). Pattern matching in dynamic texts. Symposium on Discrete Algorithms. 819–828. 15 indexed citations
18.
Alstrup, Stephen, Amir M. Ben-Amram, & Theis Rauhe. (1999). Worst-case and amortised optimality in union-find (extended abstract). 499–506. 10 indexed citations
19.
Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (1998). Direct Routing on Trees (Extended Abstract).. Symposium on Discrete Algorithms. 342–349. 1 indexed citations
20.
Alstrup, Stephen, Jacob Holm, Kristian de Lichtenberg, & Mikkel Thorup. (1998). Direct routing on trees. Symposium on Discrete Algorithms. 342–349. 8 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

Rankless by CCL
2026