Stephen Alstrup
Professor
- 1995
- Published
Optimal algorithms for finding nearest common ancestors in dynamic trees
Alstrup, Stephen, 1995, Citeseer.Research output: Book/Report › Book › Research
- 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
- 1996
- 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
- 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
- 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
Diameter and distance in dynamic trees
Alstrup, Stephen, Holm, J., Jørgensen, K. & Thorup, Mikkel, 1996.Research output: Working paper › Research
- 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
Finding dominators in linear time
Alstrup, Stephen, Lauritzen, P. W. & Thorup, Mikkel, 1996, (DIKU Report).Research output: Working paper › Research
- 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
- Published
Improved routing on trees
Alstrup, Stephen, 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, 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
- 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
- 1997
Dominators in Linear Time
Alstrup, Stephen, Harel, D., Lauridsen, P. W. & Thorup, M., 1997.Research output: Working paper › Research › peer-review
- 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
- 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
- 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
- 1998
- Published
Centrality Problems on Dynamic Trees
Alstrup, Stephen, Holm, J. & de Lichtenberg, K., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- 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
- Published
Dynamic pattern matching
Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- Published
Marked Ancestor Problems
Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 1998, In: DIKU Report. 98Research output: Contribution to journal › Journal article › Research
- 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 proceeding › Book chapter › Research › peer-review
- Published
Optimal Union-find: Upper Bounds
Alstrup, Stephen & Rauhe, T., 1998, Datalogisk Institut.Research output: Book/Report › Book › Research
- 1999
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
Word encoding tree connectivity works
Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.Research output: Contribution to journal › Journal article › Research
- 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 proceeding › Book chapter › Research › peer-review
- 2000
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
- Published
Improved algorithms for finding level ancestors in dynamic trees
Alstrup, Stephen & 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
- Published
Maintaining center and median in dynamic trees
Alstrup, Stephen, Holm, Jacob & Thorup, Mikkel, 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
- 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
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
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
- 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
- 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
- 2001
- Published
A cell probe lower bound for dynamic nearest-neighbor searching
Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 2001, Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms. p. 779-780 2 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Identifying nearest common ancestors in a distributed environment
Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2001, In: J F E Technical Report. 6Research output: Contribution to journal › Journal article › Research
- Published
Lower bounds for labeling schemes supporting, ancestor, sibling, and connectivity queries
Alstrup, Stephen & Rauhe, T., 2001.Research output: Working paper › Research
- Published
Optimal static range reporting in one dimension
Alstrup, Stephen, Brodal, G. S. & Rauhe, T., 2001, Proceedings of the thirty-third annual ACM symposium on Theory of computing. p. 476-482 7 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- 2002
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
- 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
- Published
Nearest common ancestors: a survey and a new distributed algorithm
Alstrup, Stephen, Gavoille, C., Kaplan, H. & Rauhe, T., 2002, Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures. p. 258-264 7 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- Published
Small induced-universal graphs and compact implicit graph representations
Alstrup, Stephen & Rauhe, T., 2002, Foundations of Computer Science, 2002. Proceedings. The 43rd Annual IEEE Symposium on. p. 53-62 10 p.Research output: Chapter in Book/Report/Conference proceeding › Book chapter › Research › peer-review
- 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
- 2003
- 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
- Published
Worst-case union-find with fast deletions
Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.Research output: Working paper › Research
- 2004
- Published
Dynamic nested brackets
Alstrup, Stephen, Husfeldt, T. & Rauhe, T., 2004, In: Information and Computation. 193, 2, p. 75-83 9 p.Research output: Contribution to journal › Journal article › Research › peer-review
- 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
- 2005
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
- Published
Introducing Octoshape-a new technology for largescale streaming over the Internet
Alstrup, Stephen & Rauhe, T., 2005, In: EBU Technical Review. 303Research output: Contribution to journal › Journal article › Research › peer-review
- Published
Labeling schemes for small distances in trees
Alstrup, Stephen, Bille, P. & Rauhe, T., 2005, In: SIAM Journal on Discrete Mathematics. 19, 2, p. 448-462 15 p.Research output: Contribution to journal › Journal article › Research › peer-review
Maintaining information in fully dynamic trees with top trees
Alstrup, Stephen, Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 2, p. 243-264 22 p.Research output: Contribution to journal › Journal article › Research › peer-review
ID: 37604428
Most downloads
-
1083
downloads
High-school dropout prediction using machine learning: a Danish large-scale study
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
427
downloads
Neural check-worthiness ranking with weak supervision: Finding sentences for fact-checking
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
277
downloads
Distance labeling schemes for trees
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published