Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    51 - 100 out of 241Page size: 50
    Sort by: Title

    1. 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 journal › Journal article › Research › peer-review

    2. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

      Madani, O., Thorup, Mikkel & Zwick, U., 2010, In: ACM Transactions on Algorithms. 6, 2

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

    3. Discounted deterministic Markov decision processes and discounted all-pairs shortest paths

      Madani, O., Thorup, Mikkel & Zwick, U., 2009, Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 958-967 10 p.

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

    4. Published

      Disks in Curves of Bounded Convex Curvature

      Aamand, Anders, Abrahamsen, Mikkel & Thorup, Mikkel, 2020, In: American Mathematical Monthly. 127, 7, p. 579-593 15 p.

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

    5. Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths

      Demetrescu, C., Faruolo, P., Italiano, G. F. & Thorup, Mikkel, 2006, Proceedings of the 14th European Symposium on Algorithms (ESA), LNCS 4168. p. 556-579 24 p. (Lecture notes in computer science, Vol. 4168).

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

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

    7. Don't rush into a union: take time to find your roots

      Patrascu, M. & Thorup, Mikkel, 2011, Proceedings of the forty-third annual ACM symposium on Theory of computing. Association for Computing Machinery, p. 559-567 9 p.

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

    8. Dynamic Graph Algorithms with Applications (Invited Talk)

      Thorup, Mikkel & Karger, D., 2000, Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT), LNCS 1851. p. 1-9 9 p.

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

    9. Dynamic Ordered Sets with Exponential Search Trees

      Andersson, A. & Thorup, Mikkel, 2007, In: Journal of the ACM. 54, 3, p. Article 13

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

    10. Published

      Dynamic bridge-finding in Õ(log2 n) amortized time

      Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 35-52 18 p.

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

    11. Published

      Dynamic integer sets with optimal rank, select, and predecessor search

      Patrascu, M. & Thorup, Mikkel, 2014, FOCS 2014: 55th Annual Symposium on Foundations of Computer Science. IEEE, p. 166-175 10 p.

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

    12. Published

      Dynamic ordered sets with approximate queries, approximate heaps and soft heaps

      Thorup, Mikkel, Zamir, O. & Zwick, U., 2019, 46th International Colloquium on Automata, Languages, and Programming, ICALP 2019. Chatzigiannakis, I., Baier, C., Leonardi, S. & Flocchini, P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 95. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 132).

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

    13. Dynamic string searching

      Andersson, A. & Thorup, Mikkel, 2001, Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 307-308 2 p.

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

    14. Published

      Edge sampling and graph parameter estimation via vertex neighborhood accesses

      Tetek, Jakub & Thorup, Mikkel, 2022, STOC 2022 - Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing. Leonardi, S. & Gupta, A. (eds.). Association for Computing Machinery, Inc., p. 1116-1129 14 p.

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

    15. Efficient preprocessing of simple binary pattern forests

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

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

    16. 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 proceeding › Article in proceedings › Research › peer-review

    17. Efficient stream sampling for variance-optimal estimation of subset sums

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2011, In: S I A M Journal on Computing. 40, 5, p. 1402-1431 30 p.

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

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

    19. Equivalence between Priority Queues and Sorting

      Thorup, Mikkel, 2007, In: Journal of the ACM. 54, 6, p. Article 28

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

    20. Equivalence between Priority Queues and Sorting

      Thorup, Mikkel, 2002, Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS). p. 125-134 10 p.

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

    21. Estimating Arbitrary Subset Sums with Few Probes

      Alon, N., Duffield, N., Lund, C. & Thorup, Mikkel, 2005, Proceedings of the 24th Annual ACM Symposium on Principles of Database Systems (PODS). Association for Computing Machinery, p. 317-325 9 p.

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

    22. Estimating Flow Distributions from Sampled Flow Statistics

      Duffield, N., Lund, C. & Thorup, Mikkel, 2005, In: ACM/IEEE Transactions on Networking. 13, 5, p. 933-946 14 p.

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

    23. Even Strongly Universal Hashing is Pretty Fast

      Thorup, Mikkel, 2000, Proceedings of the 11th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 496-497 2 p.

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

    24. Farvel til international forskning (debat-indlæg)

      Thorup, Mikkel, 1997, In: Berlingske Tidende, Univers. 7. oktober

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

    25. 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 journal › Journal article › Research › peer-review

    26. Published

      Fast and powerful hashing using tabulation

      Thorup, Mikkel, 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017). Chatzigiannakis, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 4. (Leibniz International Proceedings in Informatics, Vol. 80).

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

    27. Published

      Fast and powerful hashing using tabulation

      Thorup, Mikkel, 2016, 36th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2016). Lal, A., Akshay, S., Saurabh, S. & Sen, S. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2 p. 1. (Leibniz International Proceedings in Informatics, Vol. 65).

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

    28. Published

      Fast and powerful hashing using tabulation

      Thorup, Mikkel, Jul 2017, In: Communications of the ACM. 60, 7, p. 94-101 8 p.

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

    29. 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 proceeding › Article in proceedings › Research › peer-review

    30. Published

      Fast fencing

      Abrahamsen, Mikkel, Adamaszek, A., Bringmann, K., Cohen-Addad, V., Mehr, M., Rotenberg, E., Roytman, A. & Thorup, Mikkel, 2018, STOC 2018 - Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 564-573

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

    31. Published

      Fast hashing with strong concentration bounds

      Aamand, Anders, Knudsen, J. B. T., Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    32. Published

      Fast similarity sketching

      Dahlgaard, S., Knudsen, M. B. T. & Thorup, Mikkel, 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 663-671 9 p.

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

    33. Faster Regular Expression Matching

      Bille, P. & Thorup, Mikkel, 2009, Proceedings of the 36th International Colloquium on Automata, Languages and Programming (ICALP), LNCS 5555. Springer, p. 171-182 12 p.

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

    34. Published

      Faster algorithms for edge connectivity via random 2-out contractions

      Ghaffari, M., Nowicki, K. & Thorup, Mikkel, 2020, 31st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2020. Chawla, S. (ed.). Association for Computing Machinery, p. 1260-1279 20 p.

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

    35. Published

      Faster deterministic sorting and priority queues in linear space

      Thorup, Mikkel, 1998, Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 550-555

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

    36. Published

      Faster worst case deterministic dynamic connectivity

      Kejlberg-Rasmussen, C., Kopelowitz, T., Pettie, S. & Thorup, Mikkel, 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 53:1-53:15 15 p. 53. (Leibniz International Proceedings in Informatics, Vol. 57).

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

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

    38. Finding dominators in linear time

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

      Research output: Working paper

    39. Published

      Finding the maximum subset with bounded convex curvature

      Abrahamsen, Mikkel & Thorup, Mikkel, 2016, 32nd International Symposium on Computational Geometry (SoCG 2016). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 4. (Leibniz International Proceedings in Informatics, Vol. 51).

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

    40. Published

      Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor

      Cohen-Addad, V., Das, D., Kipouridis, Evangelos, Parotsidis, N. & Thorup, Mikkel, 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 1-12

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

    41. Published

      Fitting Distances by Tree Metrics Minimizing the Total Error within a Constant Factor

      Cohen-Addad, V., Das, D., Kipouridis, Evangelos, Parotsidis, N. & Thorup, Mikkel, 2024, In: Journal of the ACM. 71, 2, 41 p., 10.

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

    42. Floats, Integers, and Single Source Shortest Paths

      Thorup, Mikkel, 2000, In: Journal of Algorithms. 35, p. 189-201 13 p.

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

    43. Flow sampling under hard resource constraints

      Duffield, N., Lund, C. & Thorup, Mikkel, 2004, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). Association for Computing Machinery, p. 85-96 12 p.

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

    44. Published

      From independence to expansion and back again

      Christiani, T. L., Pagh, R. & Thorup, Mikkel, 2015, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing: STOC '15. Association for Computing Machinery, p. 813-820 8 p.

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

    45. Published

      Fully Dynamic Connectivity in O (log n((log log n)2 Amortized Expected Time

      Huang, S., Huang, D., Kopelowitz, T., Pettie, S. & Thorup, Mikkel, 2023, In: TheoretiCS. 2, p. 1-56 6.

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

    46. Published

      Fully Dynamic Exact Edge Connectivity in Sublinear Time

      Goranci, G., Henzinger, M., Nanongkai, D., Saranurak, T., Thorup, Mikkel & Wulff-Nilsen, Christian, 2023, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA). Bansal, N. & Nagarajan, V. (eds.). Society for Industrial and Applied Mathematics, p. 70-86

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

    47. Published

      Fully Dynamic Min-Cut of Superconstant Size in Subpolynomial Time

      Jin, W., Sun, X. & Thorup, Mikkel, 2024, p. 2999-3026. 28 p.

      Research output: Contribution to conference › Paper › Research › peer-review

    48. Fully-Dynamic All-Pairs Shortest Paths: Faster and Allowing Negative Cycles

      Thorup, Mikkel, 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, p. 384-396 13 p. (Lecture notes in computer science, Vol. 3111).

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

    49. Fully-Dynamic Min-Cut

      Thorup, Mikkel, 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). p. 224-230 7 p.

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

    50. Fully-Dynamic Min-Cut

      Thorup, Mikkel, 2007, In: Combinatorica. 27, 1, p. 91-127 37 p.

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

    Previous 1 2 3 4 5 Next

    ID: 34257574