Stephen Alstrup

Stephen Alstrup

Professor

Member of:


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

    2. Published

      Modelling End-of-Session Actions in Educational Systems

      Hansen, C., Hansen, C., Alstrup, Stephen & Lioma, Christina, 2019, Proceedings of The 12th International Conference on Educational Data Mining (EDM 2019). Université du Québec à Montréal, p. 306-311

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    3. Published

      Modelling Sequential Music Track Skips using a Multi-RNN Approach

      Hansen, C., Hansen, C., Alstrup, Stephen, Simonsen, Jakob Grue & Lioma, Christina, 2019, WSDM '19: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining. Association for Computing Machinery, 4 p.

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

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

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

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

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

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

    9. Published

      Neural check-worthiness ranking with weak supervision: Finding sentences for fact-checking

      Hansen, C., Hansen, C., Alstrup, Stephen, Simonsen, Jakob Grue & Lioma, Christina, 2019, The Web Conference 2019 - Companion of the World Wide Web Conference, WWW 2019. Association for Computing Machinery, p. 994-1000 7 p.

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    10. Published

      Neural speed reading with structural-jump-LSTM

      Hansen, C., Hansen, C., Alstrup, Stephen, Simonsen, Jakob Grue & Lioma, Christina, 2019.

      Research output: Contribution to conferencePaperResearchpeer-review

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

    12. Published

      On predicting student performance using low-rank matrix factorization techniques

      Lorenzen, S. S., Pham, D. N. & Alstrup, Stephen, Oct 2017, ECEL17 - Proceedings of the 16th European Conference on e-Learning. Peres, P. & Mesquita, A. (eds.). Academic Conferences and Publishing International, p. 326-334 9 p.

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearchpeer-review

    13. Published

      Optimal Union-find: Upper Bounds

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

      Research output: Book/ReportBookResearch

    14. Published

      Optimal algorithms for finding nearest common ancestors in dynamic trees

      Alstrup, Stephen, 1995, Citeseer.

      Research output: Book/ReportBookResearch

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

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

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

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

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

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

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

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

    23. Published

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

      Alstrup, Stephen, 1995, Datalogisk Institut.

      Research output: Book/ReportBookResearch

    24. Published

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

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

      Research output: Patent

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

    ID: 37604428