Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    26 - 50 out of 94Page size: 25
    1. 2000

    2. Generalized Dominators for Structured Programs

      Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 2000, In: Algorithmica. 27, 3, p. 244-253 10 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    3. Published

      Improved algorithms for finding level ancestors in dynamic trees

      Alstrup, Stephen & Holm, J., 2000, Automata, Languages and Programming (ICALP). Springer Science+Business Media, p. 73-84 12 p.

      Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

    4. Published

      Maintaining center and median in dynamic trees

      Alstrup, Stephen, Holm, Jacob & Thorup, Mikkel, 2000, Algorithm Theory-SWAT 2000. Springer Science+Business Media, Vol. 1851. p. 46-56 11 p. (Lecture notes in computer science).

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    5. Published

      New data structures for orthogonal range searching

      Alstrup, Stephen, Stolting Brodal, G. & Rauhe, T., 2000, Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. p. 198-207 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

    6. Optimal pointer algorithm for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen & Thorup, M., 2000, In: Journal of Algorithms. 35, p. 169-188 20 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    7. Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen & Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, 2, p. 169-188 20 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    8. Published

      Pattern matching in dynamic texts

      Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 2000, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. p. 819-828 10 p.

      Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review

    9. Published

      Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 2000, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. p. 498-499 2 p.

      Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review

    10. 2001
    11. 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

    12. Published

      Identifying nearest common ancestors in a distributed environment

      Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2001, In: J F E Technical Report. 6

      Research output: Contribution to journal › Journal article › Research

    13. Published

      Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries

      Alstrup, Stephen & Rauhe, T., 2001.

      Research output: Working paper › Research

    14. 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

    15. 2002

    16. 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 › Research

    17. 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

    18. 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

    19. 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

    20. 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

    21. 2003
    22. 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

    23. Published

      Worst-case union-find with fast deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.

      Research output: Working paper › Research

    24. 2004
    25. Published

      Dynamic nested brackets

      Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 2004, In: Information and Computation. 193, 2, p. 75-83 9 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    26. Published

      Nearest common ancestors: A survey and a new algorithm for a distributed environment

      Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2004, In: Theory of Computing Systems. 37, 3, p. 441-456 16 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    27. 2005

    28. Black box for constant-time insertion in priority queues (note)

      Alstrup, Stephen, Husfeldt, T., Rauhe, T. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 1, p. 102-106 5 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    29. Published

      Introducing Octoshape-a new technology for largescale streaming over the Internet

      Alstrup, Stephen & Rauhe, T., 2005, In: EBU Technical Review. 303

      Research output: Contribution to journal › Journal article › Research › peer-review

    30. Published

      Labeling schemes for small distances in trees

      Alstrup, Stephen, Bille, P. & Rauhe, T., 2005, In: SIAM Journal on Discrete Mathematics. 19, 2, p. 448-462 15 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    31. Maintaining information in fully dynamic trees with top trees

      Alstrup, Stephen, Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 2, p. 243-264 22 p.

      Research output: Contribution to journal › Journal article › Research › peer-review

    Previous 1 2 3 4 Next

    ID: 37604428