Stephen Alstrup
Professor
- 2003
- Published
Labeling schemes for small distances in trees
Alstrup, Stephen, Bille, P. & Rauhe, T., 2003, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 689-698 10 p.Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
- Published
Worst-case union-find with fast deletions
Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.Research output: Working paper › Research
- 2002
Efficient tree layout in a multilevel memory hierarchy
Alstrup, Stephen, Bender, M. A., Demaine, E. D., Farach-Colton, M., Rauhe, T. & Thorup, Mikkel, 2002, In: arXiv preprint cs/0211010.Research output: Contribution to journal › Journal article
- Published
Improved labeling scheme for ancestor queries
Alstrup, Stephen & Rauhe, T., 2002, Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (SODA). p. 947-953 7 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Nearest common ancestors: a survey and a new distributed algorithm
Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2002, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. p. 258-264 7 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Small induced-universal graphs and compact implicit graph representations
Alstrup, Stephen & Rauhe, T., 2002, Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on. p. 53-62 10 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Time and space efficient multi-method dispatching
Alstrup, Stephen, Brodal, G. S., Gørtz, I. L. & Rauhe, T., 2002, Algorithm Theory—SWAT 2002. Springer Science+Business Media, p. 20-29 10 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- 2001
- 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
- Published
Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries
Alstrup, Stephen & Rauhe, T., 2001.Research output: Working paper › Research
ID: 37604428
Most downloads
-
1077
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 -
426
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 -
274
downloads
Distance labeling schemes for trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published