Stephen Alstrup
Professor
- Published
A simple and optimal algorithm for finding immediate dominators in reducible graphs
Alstrup, Stephen & Lauridsen, P. W., 1996, In: DIKU Report.Research output: Contribution to journal › Journal article › Research
- Published
An O (V*E) Algorithm for Finding Immediate Multiple-vertex Dominators
Alstrup, Stephen, Clausen, J. & Jørgensen, K., 1996, Datalogisk Institut.Research output: Book/Report › Book › Research
- Published
An O (¦ V¦∗¦ E¦) algorithm for finding immediate multiple-vertex dominators
Alstrup, Stephen, Clausen, J. & Jørgensen, K., 1996, In: Information Processing Letters. 59, 1, p. 9-11 3 p.Research output: Contribution to journal › Journal article › Research › peer-review
Diameter and distance in dynamic trees
Alstrup, Stephen, Holm, J., Jørgensen, K. & Thorup, Mikkel, 1996.Research output: Working paper
- Published
Dynamic and Sensitivity Algorithms for All Shortest Paths
Alstrup, Stephen & Lauridsen, P. W., 1996, Datalogisk Insitut, Københavns Universitet. (DIKU Report).Research output: Book/Report › Report › Research
Finding dominators in linear time
Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).Research output: Working paper
- Published
Generalized dominators for structured programs
Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 1996, Static Analysis. Springer Science+Business Media, p. 42-51 10 p. (Lecture notes in computer science, Vol. 1145).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Improved routing on trees
Alstrup, Stephen, Holm, J. & Jørgensen, K., 1996, In: DIKU Report.Research output: Contribution to journal › Journal article › Research
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
- 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
ID: 37604428
Most downloads
-
1086
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 -
429
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 -
281
downloads
Distance labeling schemes for trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published