Stephen Alstrup
Professor
ORCID: 0000-0001-7896-8386
1 - 4 out of 4Page size: 10
- Published
A cell probe lower bound for dynamic nearest-neighbor searching
Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 2001, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. p. 779-780 2 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Identifying nearest common ancestors in a distributed environment
Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2001, In: J F E Technical Report. 6Research output: Contribution to journal › Journal article › Research
- Published
Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries
Alstrup, Stephen & Rauhe, T., 2001.Research output: Working paper
- 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
-
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