Stephen Alstrup

Stephen Alstrup

Professor

Member of:


    1. 1995
    2. Published

      Optimal algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen, 1995, Citeseer.

      Research output: Book/ReportBookResearch

    3. Published

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

      Alstrup, Stephen, 1995, Datalogisk Institut.

      Research output: Book/ReportBookResearch

    4. 1996
    5. 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 journalJournal articleResearch

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

    7. 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 journalJournal articleResearchpeer-review

    8. Diameter and distance in dynamic trees

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

      Research output: Working paperResearch

    9. 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/ReportReportResearch

    10. Finding dominators in linear time

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

      Research output: Working paperResearch

    11. 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 proceedingArticle in proceedingsResearchpeer-review

    12. Published

      Improved routing on trees

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

      Research output: Contribution to journalJournal articleResearch

    13. 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 proceedingBook chapterResearchpeer-review

    14. 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 proceedingArticle in proceedingsResearchpeer-review

    15. 1997
    16. Dominators in Linear Time

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

      Research output: Working paperResearchpeer-review

    17. 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 proceedingArticle in proceedingsResearchpeer-review

    18. 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 proceedingArticle in proceedingsResearchpeer-review

    19. 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 journalJournal articleResearchpeer-review

    20. 1998
    21. Published

      Centrality Problems on Dynamic Trees

      Alstrup, Stephen, Holm, J. & de Lichtenberg, K., 1998, Datalogisk Institut.

      Research output: Book/ReportBookResearch

    22. 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 proceedingArticle in proceedingsResearchpeer-review

    23. Published

      Dynamic pattern matching

      Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 1998, Datalogisk Institut.

      Research output: Book/ReportBookResearch

    24. Published

      Marked Ancestor Problems

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

      Research output: Contribution to journalJournal articleResearch

    25. Published

      Marked ancestor problems

      Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 1998, Foundations of Computer Science, 1998. Proceedings. 39th Annual Symposium on. p. 534-543 10 p.

      Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

    26. Published

      Optimal Union-find: Upper Bounds

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

      Research output: Book/ReportBookResearch

    27. 1999
    28. 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 journalJournal articleResearchpeer-review

    29. Word encoding tree connectivity works

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

      Research output: Contribution to journalJournal articleResearch

    30. Published

      Worst-case and amortised optimality in union-find

      Alstrup, Stephen, Ben-Amram, A. M. & Rauhe, T., 1999, Proceedings of the thirty-first annual ACM symposium on Theory of computing. p. 499-506 8 p.

      Research output: Chapter in Book/Report/Conference proceedingBook chapterResearchpeer-review

    Previous 1 2 3 4 Next

    ID: 37604428