Stephen Alstrup
Professor
ORCID: 0000-0001-7896-8386
91 - 94 out of 94Page size: 10
- 1996
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
- 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