Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    31 - 40 out of 50Page size: 10
    1. 2003
    2. 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

    3. 2002
    4. 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

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

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

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

    8. 2001
    9. 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

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

    11. 2000
    12. 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

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

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

    Previous 1 2 3 4 5 Next

    ID: 37604428