Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    1 - 10 out of 25Page size: 10
    1. 1996
    2. Published

      A simple and optimal algorithm for finding immediate dominators in reducible graphs

      Alstrup, Stephen & Lauridsen, P. W., 1996, In: DIKU Report.

      Research output: Contribution to journal › Journal article › Research

    3. Published

      An O (¦ V¦∗¦ E¦) algorithm for finding immediate multiple-vertex dominators

      Alstrup, Stephen, Clausen, J. & Jørgensen, K., 1996, In: Information Processing Letters. 59, 1, p. 9-11 3 p.

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

    4. Published

      Improved routing on trees

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

      Research output: Contribution to journal › Journal article › Research

    5. 1997
    6. Published

      Optimal on-line decremental connectivity in trees

      Alstrup, Stephen, Secher, J. P. & Spork, M., 1997, In: Information Processing Letters. 64, 4, p. 161-164 4 p.

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

    7. 1998
    8. Published

      Marked Ancestor Problems

      Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 1998, In: DIKU Report. 98

      Research output: Contribution to journal › Journal article › Research

    9. 1999

    10. Dominators in linear time

      Alstrup, Stephen, Harel, D., Lauridsen, P. W. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 6, p. 2117-2132 16 p.

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

    11. Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.

      Research output: Contribution to journal › Journal article › Research

    12. 2000

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

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

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

    Previous 1 2 3 Next

    ID: 37604428