Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    1 - 5 out of 5Page size: 10
    1. 2002

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

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

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

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

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

    ID: 37604428