Get started
Author

Stephen Alstrup

Observed names: Alstrup, S., Alstrup, Stephen, S. Alstrup
ORCID: 0000-0001-7896-8386
Observed ORCID: 0000-0001-7896-8386
OpenAlex ID: A5034291253
New data structures for orthogonal range searching
2002 · S. Alstrup, G. Stolting Brodal, et al. · Annual Symposium on Foundations of Computer Science · 161
Dominators in Linear Time
1999 · Stephen Alstrup, Dov Harel, et al. · SIAM Journal on Computing · 142
Maintaining information in fully dynamic trees with top trees
2005 · Stephen Alstrup, Jacob Holm, et al. · ACM Transactions on Algorithms · 126
PDF
Marked ancestor problems
2002 · S. Alstrup, T. Husfeldt, et al. · Annual Symposium on Foundations of Computer Science · 121
Nearest common ancestors
2002 · Stephen Alstrup, Cyril Gavoille, et al. · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · 101
Nearest Common Ancestors: A Survey and a New Algorithm for a Distributed Environment
2004 · Stephen Alstrup, Cyril Gavoille, et al. · Theory of Computing Systems · 79
Improved labeling scheme for ancestor queries
2002 · Stephen Alstrup, Theis Rauhe · 70
Optimal static range reporting in one dimension
2001 · Stephen Alstrup, Gerth Brodal, et al. · ACM Symposium on Theory of Computing (STOC) · 66
Small induced-universal graphs and compact implicit graph representations
2003 · S. Alstrup, T. Rauhe · Annual Symposium on Foundations of Computer Science · 64
Improved Algorithms for Finding Level Ancestors in Dynamic Trees
2000 · Stephen Alstrup, Jacob Holm · Lecture notes in computer science · 59
Minimizing diameters of dynamic trees
1997 · Stephen Alstrup, Jacob Holm, et al. · Lecture notes in computer science · 58
Compact Labeling Scheme for Ancestor Queries
2006 · Serge Abiteboul, Stephen Alstrup, et al. · SIAM Journal on Computing · 57
Pattern matching in dynamic texts
2000 · Stephen Alstrup, Gerth Stølting Brodal, et al. · 54
High-School Dropout Prediction Using Machine Learning: A Danish Large-scale Study.
2015 · Nicolae-Bogdan Sara, Rasmus Halland, et al. · Research at the University of Copenhagen (University of Copenhagen) · 52
Neural Check-Worthiness Ranking with Weak Supervision: Finding Sentences for Fact-Checking
2019 · Casper Hansen, Christian Hansen, et al. · International World Wide Web Conference (WWW) · 41
Labeling Schemes for Small Distances in Trees
2005 · Stephen Alstrup, Philip Bille, et al. · SIAM Journal on Discrete Mathematics · 40
Maintaining Center and Median in Dynamic Trees
2000 · Stephen Alstrup, Jacob Holm, et al. · Lecture notes in computer science · 37
Labeling schemes for small distances in trees
2003 · Stephen Alstrup, Philip Bille, et al. · 36
Neural Speed Reading with Structural-Jump-LSTM
2019 · Hansen, Christian, Hansen, Casper, et al. · arXiv (Cornell University) · 31
PDF
Finding cores of limited length
1997 · Stephen Alstrup, Peter W. Lauridsen, et al. · Lecture notes in computer science · 28
Optimal on-line decremental connectivity in trees
1997 · Stephen Alstrup, Jens Peter Secher, et al. · Information Processing Letters · 27
Adjacency Labeling Schemes and Induced-Universal Graphs
2015 · Stephen Alstrup, Haim Kaplan, et al. · ACM Symposium on Theory of Computing (STOC) · 26
Optimal Induced Universal Graphs and Adjacency Labeling for Trees
2017 · Stephen Alstrup, Søren Dahlgaard, et al. · Journal of the ACM · 25
PDF
Marked Ancestor Problems
1998 · Stephen Alstrup, Thore Husfeldt, et al. · BRICS Report Series · 23
Constructing light spanners deterministically in near-linear time
2022 · Stephen Alstrup, Søren Dahlgaard, et al. · Theoretical Computer Science · 21
Works count: 98
Citation count: 1,891
H-index: 23
I10-index: 43
Year
Topic
Type