Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. 1990
    2. On conservative extensions of syntax in the process of system development

      Blikle, A. & Thorup, Mikkel, 1990, Proceedings of VDM'90, VDM and Z---Formal Methods in Software Development, LNCS 428. Springer, p. 504-525 22 p. (Lecture notes in computer science, Vol. 428).

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

    3. Zenons paradoks -- ren logik eller snedig rethorik

      Thorup, Mikkel, 1990, In: Kvant, Fysisk Tidskrift. 1, p. 24-26 3 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    4. 1991
    5. On conservative extensions of syntax in system development

      Blikle, A., Tarlecki, A. & Thorup, Mikkel, 1991, In: Theoretical Computer Science. 90, 1, p. 209-233 25 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    6. 1992
    7. Ambiguity for incremental parsing and evaluation

      Thorup, Mikkel, 1992, Oxford university computing laboratory.

      Research output: Working paperResearch

    8. 1993
    9. On Shortcutting Digraphs

      Thorup, Mikkel, 1993, Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science (WG), LNCS 657. Springer, p. 205-211 7 p. (Lecture notes in computer science, Vol. 657).

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

    10. Topics in Computation

      Thorup, Mikkel, 1993

      Research output: Book/ReportPh.D. thesisResearch

    11. 1994
    12. Controlled grammatic ambiguity

      Thorup, Mikkel, 1994, In: ACM Transactions on Programming Languages and Systems. 16, 3, p. 1024-1050

      Research output: Contribution to journalJournal articleResearchpeer-review

    13. Efficient preprocessing of simple binary pattern forests

      Thorup, Mikkel, 1994, Proceedings of the 4th Scandinavian Workshop on Algorithm Theory. Springer, p. 350-358

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

    14. Fast comparison of evolutionary trees

      Farach, M. & Thorup, Mikkel, 1994, Proceedings of the 5th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 481-488 8 p.

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

    15. Optimal evolutionary tree comparison by sparse dynamic programming

      Farach, M. & Thorup, Mikkel, 1994, Proceedings of the 35th IEEE Symposium on Foundations of Computer Science (FOCS). p. 770-779 10 p.

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

    16. 1995
    17. An $O(loglog n)$ Priority Queue

      Thorup, Mikkel, 1995.

      Research output: Working paperResearch

    18. Computing the agreement of trees with bounded degrees

      Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, Proceedings of the 3rd Annual European Symposium on Algorithms, LNCS 979. Springer, p. 381-393

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

    19. Fast Comparison of Evolutionary Trees

      Farach, M. & Thorup, Mikkel, 1995, In: Information and Computation. 123, 1, p. 29-37 9 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    20. Improved Sampling with Applications to Dynamic Graph Algorithms

      Henzinger, M. R. & Thorup, Mikkel, 1995.

      Research output: Working paperResearch

    21. On the Agreement of Many Trees

      Farach, M., Przytycka, T. M. & Thorup, Mikkel, 1995, In: Information Processing Letters. p. 297-301

      Research output: Contribution to journalJournal articleResearchpeer-review

    22. Shortcutting planar diagraphs

      Thorup, Mikkel, 1995, In: Combinatorics, Probability & Computing. 4, p. 287-315

      Research output: Contribution to journalJournal articleResearchpeer-review

    23. String Matching in Lempel-Ziv Compressed Strings

      Farach, M. & Thorup, Mikkel, 1995, Proceedings of the 27th ACM Symposium on the Theory of Computing (STOC). p. 703-712 10 p.

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

    24. 1996
    25. A Pragmatic Implementation of Monotone Priority Queues

      Andersson, A. & Thorup, Mikkel, 1996, In: Unpublished.

      Research output: Contribution to journalJournal articleResearch

    26. Diameter and distance in dynamic trees

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

      Research output: Working paperResearch

    27. Disambiguating Grammars by Exclusion of Sub-Parse Trees

      Thorup, Mikkel, 1996, In: Acta Informatica. 33, 6, p. 511-522 12 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    28. Efficient preprocessing of simple binary pattern forests

      Thorup, Mikkel, 1996, In: Journal of Algorithms. 20, p. 602-612 11 p.

      Research output: Contribution to journalJournal articleResearchpeer-review

    29. Finding dominators in linear time

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

      Research output: Working paperResearch

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

    31. Improved Sampling with Applications to Dynamic Graph Algorithms

      Henzinger, M. R. & Thorup, Mikkel, 1996, Proceedings of the 23rd International Colloquium on Automata Languages, and Programming (ICALP), LNCS 1099. p. 290-299 10 p.

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

    32. On RAM Priority Queues

      Thorup, Mikkel, 1996, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 59-67 9 p.

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

    Previous 1 2 3 4 5 6 7 8 ...10 Next

    ID: 34257574