Stephen Alstrup
Professor
ORCID: 0000-0001-7896-8386
1 - 7 out of 7Page size: 100
- 1998
- Published
Centrality Problems on Dynamic Trees
Alstrup, Stephen, Holm, J. & de Lichtenberg, K., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- Published
Dynamic pattern matching
Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- Published
Optimal Union-find: Upper Bounds
Alstrup, Stephen & Rauhe, T., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- 1996
- 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
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
- 1995
- Published
Optimal algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen, 1995, Citeseer.Research output: Book/Report › Book › Research
- Published
Optimale dymamiske algoritmer til bestemmelse af nærmeste fælles forfædre på pointermaskiner
Alstrup, Stephen, 1995, Datalogisk Institut.Research output: Book/Report › Book › Research
ID: 37604428
Most downloads
-
1082
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