Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    51 - 100 out of 241Page size: 50
    1. 2016
    2. 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

    3. Published

      Heavy hitters via cluster-preserving clustering

      Larsen, K. G., Nelson, J., Nguyen, H. L. & Thorup, Mikkel, 2016, Proceedings - 57th Annual IEEE Symposium on Foundations of Computer Science. IEEE, p. 61-70 10 p.

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

    4. Published

      Incremental exact min-cut in poly-logarithmic amortized update time

      Goranci, G., Henzinger, M. & Thorup, Mikkel, 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 17 p. 46. (Leibniz International Proceedings in Informatics, Vol. 57).

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

    5. Published

      On the k-independence required by linear probing and minwise independence

      Pǎtraşcu, M. & Thorup, Mikkel, 2016, In: ACM Transactions on Algorithms. 12, 1, 27 p., 8.

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

    6. Published

      The power of two choices with simple tabulation

      Dahlgaard, S., Knudsen, M. B. T., Rotenberg, E. & Thorup, Mikkel, 2016, Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms. Krauthgamer, R. (ed.). Society for Industrial and Applied Mathematics, p. 1631-1642 12 p.

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

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

    9. Published

      Construction and impromptu repair of an MST in a distributed network with o(m) communication

      King, V., Kutten, S. & Thorup, Mikkel, 2015, Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, p. 71-80 10 p.

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

    10. Published

      Deterministic global minimum cut of a simple graph in near-linear time

      Kawarabayashi, K. & Thorup, Mikkel, 2015, Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing: STOC '15. Association for Computing Machinery, p. 665-674 10 p.

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

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

    12. Published

      Hashing for statistics over k-partitions

      Dahlgaard, S., Knudsen, M. B. T., Rotenberg, E. & Thorup, Mikkel, 2015, Proceedings. 56th Annual Symposium on Foundations of Computer Science. IEEE, p. 1292-1310 19 p.

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

    13. Published

      Planar reachability in linear space and constant time

      Holm, Jacob, Rotenberg, E. & Thorup, Mikkel, 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 370-389 20 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

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

    14. Published

      RAM-efficient external memory sorting

      Arge, L. & Thorup, Mikkel, 2015, In: Algorithmica. 73, 4, p. 623-636 14 p.

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

    15. Published

      Sample(x)=(a*x< =t) is a distinguisher with probability 1/8

      Thorup, Mikkel, 2015, Proceedings. 56th Annual Symposium on Foundations of Computer Science. IEEE, p. 1277-1291 15 p. (Symposium on Foundations of Computer Science. Annual Proceedings).

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

    16. 2014
    17. Published

      Algorithms and estimators for summarization of unaggregated data streams

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2014, In: Journal of Computer and System Sciences. 80, 7, p. 1214-1244 31 p.

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

    18. Published

      Approximately minwise independence with twisted tabulation

      Dahlgaard, S. & Thorup, Mikkel, 2014, Algorithm Theory – SWAT 2014: 14th Scandinavian Symposium and Workshops, Copenhagen, Denmark, July 2-4, 2014. Proceedings. Ravi, R. & Gørtz, I. L. (eds.). Springer, p. 134-145 12 p. (Lecture notes in computer science, Vol. 8503).

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

    19. Published

      Coloring 3-colorable graphs with o(n 1/5) colors

      Kawarabayashi, K. & Thorup, Mikkel, 2014, 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014). Mayr, E. W. & Portier, N. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 458-469 12 p. (Leibniz International Proceedings in Informatics, Vol. 25).

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

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

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

    22. 2013
    23. Published

      Bottom-k and priority sampling, set similarity and subset sums with minimal independence

      Thorup, Mikkel, 2013, STOC '13: Proceedings of the 45th Annual ACM Symposium on Symposium on Theory of Computing. Association for Computing Machinery, p. 371-380 10 p.

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

    24. Published

      Funding successful research

      Thorup, Mikkel, 2013, In: Communications of the A C M. 56, 3, p. 38-39 2 p.

      Research output: Contribution to journal › Comment/debate › Research

    25. Intra-domain traffic engineering with shortest path routing protocols

      Altin, A., Fortz, B., Thorup, Mikkel & Ümit, H., 2013, In: Annals of Operations Research. 204, 1, p. 56-95 40 p.

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

    26. Published

      Mihai Pätrascu: obituary and open problems

      Thorup, Mikkel, 2013, In: SIGACT News. 44, 1, p. 110-114 5 p.

      Research output: Contribution to journal › Journal article › Research

    27. Published

      More compact oracles for approximate distances in undirected planar graphs

      Kawarabayashi, K., Sommer, C. & Thorup, Mikkel, 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 550-563 14 p.

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

    28. Published

      Nearest neighbor classification using bottom-k sketches

      Dahlgaard, S., Igel, Christian & Thorup, Mikkel, 2013, 2013 IEEE International Conference on Big Data: proceedings. IEEE, p. 28-34 7 p.

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

    29. Published

      RAM-efficient external memory sorting

      Arge, L. & Thorup, Mikkel, 2013, Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings. Cai, L., Cheng, S-W. & Lam, T-W. (eds.). Springer, p. 491-501 11 p. (Lecture notes in computer science, Vol. 8283).

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

    30. Published

      Simple tabulation, fast expanders, double tabulation, and high independence

      Thorup, Mikkel, 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 90-99 10 p.

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

    31. Published

      Twisted tabulation hashing

      Thorup, Mikkel & Patrascu, M., 2013, Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Khanna, S. (ed.). Association for Computing Machinery, p. 209-228 20 p.

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

    32. 2012
    33. Published

      A new infinity of distance oracles for sparse graphs

      Patrascu, M., Roditty, L. & Thorup, Mikkel, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 738-747 10 p.

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

    34. Published

      Combinatorial coloring of 3-colorable graphs

      Kawarabayashi, K. & Thorup, Mikkel, 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science. IEEE, p. 68-75 8 p.

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

    35. Tabulation-based 5-independent hashing with applications to linear probing and second moment estimation

      Thorup, Mikkel & Zhang, Y., 2012, In: S I A M Journal on Computing. 41, 2, p. 293-331 39 p.

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

    36. Published

      The power of simple tabulation hashing

      Patracu, M. & Thorup, Mikkel, 2012, In: Association for Computing Machinery. Journal. 59, 3, 50 p., 14.

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

    37. 2011

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

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

    40. The minimum k-way cut of bounded size is fixed-parameter tractable

      Kawarabayashi, K. & Thorup, Mikkel, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science. Ostrovsky, R. (ed.). IEEE, p. 160-169 10 p.

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

    41. The power of simple tabulation hashing

      Patrascu, M. & Thorup, Mikkel, 2011, Proceedings of the 43rd annual ACM symposium on Theory of computing. Association for Computing Machinery, p. 1-10 10 p.

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

    42. Timeouts with time-reversed linear probing

      Thorup, Mikkel, 2011, 2011 Proceedings IEEE INFOCOM. IEEE, p. 166-170 5 p.

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

    43. 2010

    44. Changing base without losing space

      Dodis, Y., Patracu, M. & Thorup, Mikkel, 2010, Proceedings of the 42nd Annual ACM Symposium on Theory of Computing (STOC). ACM, p. 593-602 10 p.

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

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

    46. On the k-Independence Required by Linear Probing and Minwise Independence

      Pǎtraşcu, M. & Thorup, Mikkel, 2010, Proceedings of the 37th International Colloquium on Automata, Languages and Programming (ICALP), Part I, LNCS 6198. Springer, p. 715-726 12 p. (Lecture notes in computer science, Vol. 6198).

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

    47. Regular Expression Matching with Multi-Strings and Intervals

      Bille, P. & Thorup, Mikkel, 2010, SODA. SIAM, p. 1297-1308 12 p.

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

    48. Tabulation Based 5-Universal Hashing and Linear Probing

      Thorup, Mikkel & Zhang, Y., 2010, Proceedings of the 12th Workshop on Algorithm Engineering and Experiments (ALENEX). SIAM, p. 62-76 15 p.

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

    49. 2009

    50. Composable, Scalable, and Accurate Weight Summarization of Unaggregated Data Sets

      Cohen, E., Duffield, N. G., Kaplan, H., Lund, C. & Thorup, Mikkel, 2009, In: Proceedings of Very Large Databases (VLDB) Endowment. 2, 1, p. 431-442 12 p.

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

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

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

    53. Higher Lower Bounds for Near-Neighbor and Further Rich Problems

      Patracu, M. & Thorup, Mikkel, 2009, In: sicomp. 39, 2, p. 730-741 12 p.

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

    54. Intra-domain traffic engineering with shortest path routing protocols

      Altin, A., Fortz, B., Thorup, Mikkel & Ümit, H., 2009, In: 4OR. 7, 4, p. 301-335 35 p.

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

    55. Maximum overhang

      Paterson, M., Peres, Y., Thorup, Mikkel, Winkler, P. & Zwick, U., 2009, In: American Mathematical Monthly. 116, 9, p. 763-787 25 p.

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

    56. Stream sampling for variance-optimal estimation of subset sums

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2009, Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 1255-1264 10 p.

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

    57. String hashing for linear probing

      Thorup, Mikkel, 2009, Proceedings of the 20th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 655-664 10 p.

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

    58. 2008

    59. Compact name-independent routing with minimum stretch

      Abraham, I., Gavoille, C., Malkhi, D., Nisan, N. & Thorup, Mikkel, 2008, In: ACM Transactions on Algorithms. 4, 3, p. Article 37

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

    Previous 1 2 3 4 5 Next

    ID: 34257574