Stephen Alstrup

Research output

Research output per year 1995 1996 1998 2000 2002 2005 2014 2016 2017 2020

• 26 Article in proceedings
• 24 Journal article
• 13 Book chapter
• 6 Book
• 13 More
  • 5 Working paper
  • 3 Patent
  • 1 Report
  • 1 Conference abstract for conference
  • 1 Paper
  • 1 Contribution to newspaper - Comment/debate
  • 1 Net publication - Internet publication

Research output per year

Research output per year

Search results

• 2000

  Improved algorithms for finding level ancestors in dynamic trees

  Alstrup, S. & Holm, J., 2000, Automata, Languages and Programming (ICALP). Springer Science+Business Media, p. 73-84 12 p.

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

  41 Citations (Scopus)

• Maintaining center and median in dynamic trees

  Alstrup, S., Holm, J. & Thorup, M., 2000, Algorithm Theory-SWAT 2000. Springer Science+Business Media, Vol. 1851. p. 46-56 11 p. (Lecture notes in computer science).

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

  21 Citations (Scopus)

• New data structures for orthogonal range searching

  Alstrup, S., 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

  134 Citations (Scopus)

• Optimal pointer algorithm for finding nearest common ancestors in dynamic trees

  Alstrup, S. & Thorup, M., 2000, In: Journal of Algorithms. 35, p. 169-188 20 p.

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

  13 Citations (Scopus)

• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

  Alstrup, S. & Thorup, M., 2000, In: Journal of Algorithms. 35, 2, p. 169-188 20 p.

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

  13 Citations (Scopus)

• Pattern matching in dynamic texts

  Alstrup, S., 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

  49 Citations (Scopus)

• Word encoding tree connectivity works

  Alstrup, S., Secher, J. P. & Thorup, M., 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
• 1999

  Dominators in linear time

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

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

  94 Citations (Scopus)

• Word encoding tree connectivity works

  Alstrup, S., Secher, J. P. & Thorup, M., 1999, In: DIKU Report.

  Research output: Contribution to journal › Journal article › Research

• Worst-case and amortised optimality in union-find

  Alstrup, S., 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 proceeding › Book chapter › Research › peer-review

  17 Citations (Scopus)
• 1998

  Centrality Problems on Dynamic Trees

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

  Research output: Book/Report › Book › Research

• Direct Routing on Trees

  Alstrup, S., Holm, J., de Lichtenberg, K. & Thorup, M., 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

  12 Citations (Scopus)

• Dynamic pattern matching

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

  Research output: Book/Report › Book › Research

• Marked ancestor problems

  Alstrup, S., 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 proceeding › Book chapter › Research › peer-review

  82 Citations (Scopus)

• Marked Ancestor Problems

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

  Research output: Contribution to journal › Journal article › Research

  82 Citations (Scopus)

• Optimal Union-find: Upper Bounds

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

  Research output: Book/Report › Book › Research
• 1997

  Dominators in Linear Time

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

  Research output: Working paper › Research › peer-review

• Finding cores of limited length

  Alstrup, S., Lauridsen, P. W., Sommerlund, P. & Thorup, M., 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

  15 Citations (Scopus)

• Minimizing diameters of dynamic trees

  Alstrup, S., Holm, J., de Lichtenberg, K. & Thorup, M., 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

  26 Citations (Scopus)

• Optimal on-line decremental connectivity in trees

  Alstrup, S., 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

  18 Citations (Scopus)
• 1996

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

  Alstrup, S., 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

  8 Citations (Scopus)

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

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

  Research output: Book/Report › Book › Research

  8 Citations (Scopus)

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

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

  Research output: Contribution to journal › Journal article › Research

• Diameter and distance in dynamic trees

  Alstrup, S., Holm, J., Jørgensen, K. & Thorup, M., 1996.

  Research output: Working paper › Research

• Dynamic and Sensitivity Algorithms for All Shortest Paths

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

  Research output: Book/Report › Report › Research

• Finding dominators in linear time

  Alstrup, S., Lauritzen, P. W. & Thorup, M., 1996, (DIKU Report).

  Research output: Working paper › Research

• Generalized dominators for structured programs

  Alstrup, S., Lauridsen, P. W. & Thorup, M., 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

  4 Citations (Scopus)

• Improved routing on trees

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

  Research output: Contribution to journal › Journal article › Research

• Optimal pointer algorithm for finding nearest common ancestors in dynamic trees

  Alstrup, S. & 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

  1 Citation (Scopus)

• Optimal pointer algorithms for finding nearest common ancestors in dynamic trees

  Alstrup, S. & Thorup, M., 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

  1 Citation (Scopus)
• 1995

  Optimal algorithms for finding nearest common ancestors in dynamic trees

  Alstrup, S., 1995, Citeseer.

  Research output: Book/Report › Book › Research

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

  Alstrup, S., 1995, Datalogisk Institut.

  Research output: Book/Report › Book › Research