Stephen Alstrup
Professor
- Published
Optimal Union-find: Upper Bounds
Alstrup, Stephen & Rauhe, T., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- Published
Optimal algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen, 1995, Citeseer.Research output: Book/Report › Book › Research
- Published
Optimal induced universal graphs and adjacency labeling for trees
Alstrup, Stephen, Dahlgaard, S. & Knudsen, M. B. T., 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1311-1326 16 p. (Symposium on Foundations of Computer Science. Annual Proceedings).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Optimal induced universal graphs and adjacency labeling for trees
Alstrup, Stephen, Dahlgaard, S. & Knudsen, M. B. T., Sep 2017, In: Journal of the ACM. 64, 4, 22 p., 27.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Optimal on-line decremental connectivity in trees
Alstrup, Stephen, Secher, J. P. & Spork, M., 1997, In: Information Processing Letters. 64, 4, p. 161-164 4 p.Research output: Contribution to journal › Journal article › Research › peer-review
Optimal pointer algorithm for finding nearest common ancestors in dynamic trees
Alstrup, Stephen & Thorup, M., 2000, In: Journal of Algorithms. 35, p. 169-188 20 p.Research output: Contribution to journal › Journal article › Research › peer-review
Optimal pointer algorithm for finding nearest common ancestors in dynamic trees
Alstrup, Stephen & Thorup, M., 1996, Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097. p. 212-222 11 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen & Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, 2, p. 169-188 20 p.Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Optimal pointer algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen & Thorup, Mikkel, 1996, Algorithm Theory—SWAT'96. Springer Science+Business Media, p. 212-222 11 p. (Lecture notes in computer science, Vol. 1097).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Optimal static range reporting in one dimension
Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 2001, Proceedings of the thirty-third annual ACM symposium on Theory of computing. p. 476-482 7 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
ID: 37604428
Most downloads
-
1083
downloads
High-school dropout prediction using machine learning: a Danish large-scale study
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
427
downloads
Neural check-worthiness ranking with weak supervision: Finding sentences for fact-checking
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
277
downloads
Distance labeling schemes for trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published