Stephen Alstrup
Stephen Alstrup
University of Copenhagen (back after 10 years in "startup")
Verified email at di.ku.dk - Homepage
Title
Cited by
Cited by
Year
Compact labeling schemes for ancestor queries
S Abiteboul, S Alstrup, H Kaplan, T Milo, T Rauhe
SIAM J. Comput. 35 (6), 1295-1309, 2006
2452006
New data structures for orthogonal range searching
S Alstrup, G Stolting Brodal, T Rauhe
41st Annual Symposium on Foundations of Computer Science (FOCS), 198-207, 2000
2072000
Dominators in linear time
S Alstrup, D Harel, PW Lauridsen, M Thorup
SIAM Journal on Computing 28 (6), 2117-2132, 1999
1641999
Marked ancestor problems
S Alstrup, T Husfeldt, T Rauhe
39th Annual Symposium on Foundations of Computer Science (FOCS), 534-543, 1998
1441998
Maintaining information in fully dynamic trees with top trees
S Alstrup, J Holm, KD Lichtenberg, M Thorup
Acm Transactions on Algorithms (talg) 1 (2), 243-264, 2005
1412005
Improved labeling scheme for ancestor queries
S Alstrup, T Rauhe
Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete …, 2002
1082002
Nearest common ancestors: a survey and a new distributed algorithm
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms …, 2002
1072002
Nearest common ancestors: A survey and a new algorithm for a distributed environment
S Alstrup, C Gavoille, H Kaplan, T Rauhe
Theory of Computing Systems 37 (3), 441-456, 2004
1022004
Labeling schemes for small distances in trees
S Alstrup, P Bille, T Rauhe
SIAM Journal on Discrete Mathematics 19 (2), 448-462, 2005
842005
Labeling schemes for small distances in trees
S Alstrup, P Bille, T Rauhe
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete …, 2003
842003
Pattern matching in dynamic texts
S Alstrup, GS Brodal, T Rauhe
Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms …, 2000
76*2000
Small induced-universal graphs and compact implicit graph representations
S Alstrup, T Rauhe
43rd Symposium on Foundations of Computer Science (FOCS), 53-62, 2002
752002
Improved algorithms for finding level ancestors in dynamic trees
S Alstrup, J Holm
Automata, Languages and Programming, 27th International Colloquium (ICALP …, 2000
682000
Minimizing diameters of dynamic trees
S Alstrup, J Holm, K de Lichtenberg, M Thorup
Automata, Languages and Programming, 24th International Colloquium (ICALP …, 1997
681997
Optimal static range reporting in one dimension
S Alstrup, G Brodal, T Rauhe
Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001
642001
High-school dropout prediction using machine learning: A danish large-scale study
NB Sara, R Halland, C Igel, S Alstrup
ESANN 2015 proceedings, European Symposium on Artificial Neural Networks …, 2015
532015
Maintaining center and median in dynamic trees
S Alstrup, J Holm, M Thorup
7th Scandinavian Workshop on Algorithm Theory (SWAT), 46-56, 2000
51*2000
Adjacency labeling schemes and induced-universal graphs
S Alstrup, H Kaplan, M Thorup, U Zwick
SIAM Journal on Discrete Mathematics 33 (1), 116-137, 2019
38*2019
Optimal on-line decremental connectivity in trees
S Alstrup, JP Secher, M Spork
Information Processing Letters 64 (4), 161-164, 1997
381997
Introducing Octoshape-a new technology for largescale streaming over the Internet
S Alstrup, T Rauhe
EBU Technical Review 303, 2005
352005
The system can't perform the operation now. Try again later.
Articles 1–20