Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    41 - 50 out of 94Page size: 10
    Sort by: 1st author
    1. Published

      Optimal induced universal graphs and adjacency labeling for trees

      Alstrup, Stephen, Dahlgaard, S. & Knudsen, M. B. T., Sep 2017, In: Journal of the ACM. 64, 4, 22 p., 27.

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

    2. Published

      Simpler, faster and shorter labels for distances in graphs

      Alstrup, Stephen, Gavoille, C., Halvorsen, E. B. & Petersen, H., 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, p. 338-350 13 p.

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

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

    4. Published

      Constructing light spanners deterministically in near-linear time

      Alstrup, Stephen, Dahlgaard, S., Filtser, A., Stöckel, M. & Wulff-Nilsen, Christian, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 15 p. 4. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).

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

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

    6. Finding dominators in linear time

      Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).

      Research output: Working paper › Research

    7. Published

      Minimizing diameters of dynamic trees

      Alstrup, Stephen, Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1997, Automata, Languages and Programming. Springer Science+Business Media, p. 270-280 11 p. (Lecture notes in computer science, Vol. 1256).

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

    8. Published

      Direct Routing on Trees

      Alstrup, Stephen, Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms. p. 342-349 8 p. (9th ACM-SIAM Symposium on Discrete Algorithms (SODA)).

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

    9. Published

      Improved routing on trees

      Alstrup, Stephen, Holm, J. & Jørgensen, K., 1996, In: DIKU Report.

      Research output: Contribution to journal › Journal article › Research

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

    Previous 1 2 3 4 5 6 7 8 ...10 Next

    ID: 37604428