Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

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

      Nearest common ancestors: A survey and a new algorithm for a distributed environment

      Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2004, In: Theory of Computing Systems. 37, 3, p. 441-456 16 p.

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

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

    3. Published

      New data structures for orthogonal range searching

      Alstrup, Stephen, Stolting Brodal, G. & Rauhe, T., 2000, Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on. p. 198-207 10 p.

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

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

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

    6. Published

      Improved routing on trees

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

      Research output: Contribution to journal › Journal article › Research

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

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

    9. Finding dominators in linear time

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

      Research output: Working paper › Research

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

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

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

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

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

    15. Published

      Optimal induced universal graphs and adjacency labeling for trees

      Alstrup, Stephen, Dahlgaard, S. & Knudsen, M. B. T., 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1311-1326 16 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

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

    16. Published

      A Hamiltonian Cycle in the Square of a 2-connected Graph in Linear Time

      Alstrup, Stephen, Georgakopoulos, A., Rotenberg, E. & Thomassen, C., 2018, Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 1645-1649

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

    17. Published

      Optimal algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen, 1995, Citeseer.

      Research output: Book/Report › Book › Research

    18. Published

      Danmark: et digitalt uland?

      Alstrup, Stephen, 21 Oct 2014

      Research output: Other contribution › Net publication - Internet publication › Communication

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

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

    21. Published

      Centrality Problems on Dynamic Trees

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

      Research output: Book/Report › Book › Research

    22. Published

      PEER OF A PEER-TO-PEER NETWORK AND SUCH NETWORK

      Alstrup, Stephen & Rauhe, T., 1 Mar 2007

      Research output: Patent

    23. Published

      Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries

      Alstrup, Stephen & Rauhe, T., 2001.

      Research output: Working paper › Research

    24. Black box for constant-time insertion in priority queues (note)

      Alstrup, Stephen, Husfeldt, T., Rauhe, T. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 1, p. 102-106 5 p.

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

    25. Published

      Labeling schemes for small distances in trees

      Alstrup, Stephen, Bille, P. & Rauhe, T., 2003, Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 689-698 10 p.

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

    Previous 1 2 3 4 Next

    ID: 37604428