Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

    Publication year:
    All
    76 - 92 out of 92Page size: 25
    1. 1998
    2. Published

      Optimal Union-find: Upper Bounds

      Alstrup, Stephen & Rauhe, T., 1998, Datalogisk Institut.

      Research output: Book/Report › Book › Research

    3. 1997

    4. Dominators in Linear Time

      Alstrup, Stephen, Harel, D., Lauridsen, P. W. & Thorup, M., 1997.

      Research output: Working paper › Research › peer-review

    5. Published

      Finding cores of limited length

      Alstrup, Stephen, Lauridsen, P. W., Sommerlund, P. & Thorup, Mikkel, 1997, Proceedings of the 5th International Workshop on Algorithms and Data Structures (WADS). Springer, Vol. 1272. p. 45-54 11 p. (Lecture notes in computer science).

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

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

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

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

    10. Published

      An O (V*E) Algorithm for Finding Immediate Multiple-vertex Dominators

      Alstrup, Stephen, Clausen, J. & Jørgensen, K., 1996, Datalogisk Institut.

      Research output: Book/Report › Book › Research

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

    12. Diameter and distance in dynamic trees

      Alstrup, Stephen, Holm, J., Jørgensen, K. & Thorup, Mikkel, 1996.

      Research output: Working paper › Research

    13. Published

      Dynamic and Sensitivity Algorithms for All Shortest Paths

      Alstrup, Stephen & Lauridsen, P. W., 1996, Datalogisk Insitut, Københavns Universitet. (DIKU Report).

      Research output: Book/Report › Report › Research

    14. Finding dominators in linear time

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

      Research output: Working paper › Research

    15. Published

      Generalized dominators for structured programs

      Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 1996, Static Analysis. Springer Science+Business Media, p. 42-51 10 p. (Lecture notes in computer science, Vol. 1145).

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

    16. Published

      Improved routing on trees

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

      Research output: Contribution to journal › Journal article › Research

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

      Alstrup, Stephen & Thorup, M., 1996, Proceedings of the 5th Scandinavian Workshop on Algorithm Theory (SWAT), LNCS 1097. p. 212-222 11 p.

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

    18. Published

      Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen & Thorup, Mikkel, 1996, Algorithm Theory—SWAT'96. Springer Science+Business Media, p. 212-222 11 p. (Lecture notes in computer science, Vol. 1097).

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

    19. 1995
    20. Published

      Optimal algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen, 1995, Citeseer.

      Research output: Book/Report › Book › Research

    21. Published

      Optimale dymamiske algoritmer til bestemmelse af nærmeste fælles forfædre på pointermaskiner

      Alstrup, Stephen, 1995, Datalogisk Institut.

      Research output: Book/Report › Book › Research

    Previous 1 2 3 4 Next

    ID: 37604428