Stephen Alstrup

Stephen Alstrup

Professor

Member of:

    ORCID: 0000-0001-7896-8386

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

      Compact labeling scheme for ancestor queries

      Abiteboul, S., Alstrup, Stephen, Kaplan, H., Milo, T. & Rauhe, T., 2006, In: SIAM Journal on Computing. 35, 6, p. 1295-1309 15 p.

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

    2. Published

      Near-optimal induced universal graphs for cycles and paths

      Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2020, In: Discrete Applied Mathematics. 282, p. 1-13 13 p.

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

    3. Published

      Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

      Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).

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

    4. Published

      DABAI: A data driven project for e-Learning in Denmark

      Alstrup, Stephen, Hansen, C., Hansen, C., Hjuler, N., Lorenzen, S. & Pham, N., 1 Jan 2017, ECEL17 - Proceedings of the 16th European Conference on e-Learning. Peres, P. & Mesquita, A. (eds.). Academic Conferences and Publishing International, p. 18-24 7 p.

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

    5. Published

      Distribution method, preferably applied in a streaming system

      Alstrup, Stephen & Rauhe, T., 1 Aug 2009

      Research output: Patent

    6. Published

      Sublinear distance labeling

      Alstrup, Stephen, Dahlgaard, S., Knudsen, M. B. T. & Porat, E., 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 5. (Leibniz International Proceedings in Informatics, Vol. 57).

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

    7. Published

      Optimal Union-find: Upper Bounds

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

      Research output: Book/Report › Book › Research

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

    9. Published

      Near-optimal labeling schemes for nearest common ancestors

      Alstrup, Stephen, Halvorsen, E. B. & Larsen, K. G., 2014, Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms . Chekuri, C. (ed.). Society for Industrial and Applied Mathematics, p. 972-982 11 p.

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

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

    11. Video consumption dramatically outpaces Internet capacity: exploration, challenges and solutions

      Alstrup, Stephen, Rauhe, T. & Brown, S., 2011, In: EBU Technical Review. 14 p.

      Research output: Contribution to journal › Journal article › Research

    12. Dominators in Linear Time

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

      Research output: Working paper › Research › peer-review

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

    14. Published

      Union-find with constant time deletions

      Alstrup, Stephen, Thorup, Mikkel, Gørtz, I. L., Rauhe, T. & Zwick, U., 2014, In: A C M Transactions on Algorithms. 11, 1, 28 p., 6.

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

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

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

    17. Diameter and distance in dynamic trees

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

      Research output: Working paper › Research

    18. Published

      Adjacency labeling schemes and induced-universal graphs

      Alstrup, Stephen, Kaplan, H., Thorup, Mikkel & Zwick, U., 2015, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, June 14-17, 2015: STOC '15. Association for Computing Machinery, p. 625-634 10 p.

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

    19. Published

      Adjacency Labeling Schemes and Induced-Universal Graphs

      Alstrup, Stephen, Kaplan, H., Thorup, Mikkel & Zwick, U., 2019, In: SIAM Journal on Discrete Mathematics. 33, 1, p. 116-137

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

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

    21. Published

      Introducing Octoshape-a new technology for largescale streaming over the Internet

      Alstrup, Stephen & Rauhe, T., 2005, In: EBU Technical Review. 303

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

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

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

    24. Published

      Distance labeling schemes for trees

      Alstrup, Stephen, Gørtz, I. L., Halvorsen, E. B. & Porat, E., 2016, 43rd International Colloquium on Automata, Languages, and Programming (ICALP 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 132. (Leibniz International Proceedings in Informatics, Vol. 55).

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

    25. Published

      800.000 gode grunde til datalogi i skolen

      Alstrup, Stephen, Madsen, O. L. & Rootzen, H., 21 Apr 2016, In: Berlingske Tidende. p. 31 1 p.

      Research output: Contribution to journal › Contribution to newspaper - Comment/debate › Communication

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

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

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

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

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

    31. Published

      Improved routing on trees

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

      Research output: Contribution to journal › Journal article › Research

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

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

    34. Finding dominators in linear time

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

      Research output: Working paper › Research

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

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

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

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

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

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

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

    42. Published

      Optimal algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen, 1995, Citeseer.

      Research output: Book/Report › Book › Research

    43. Published

      Danmark: et digitalt uland?

      Alstrup, Stephen, 21 Oct 2014

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

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

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

    46. Published

      Centrality Problems on Dynamic Trees

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

      Research output: Book/Report › Book › Research

    47. Published

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

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

      Research output: Patent

    48. Published

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

      Alstrup, Stephen & Rauhe, T., 2001.

      Research output: Working paper › Research

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

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

    ID: 37604428