Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

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

    1. A Memetic Algorithms for OSPF Routing

      Buriol, L. S., Resende, M. G. C., Ribeiro, C. C. & Thorup, Mikkel, 2002, Proceedings of the 6th INFORMS Telecom. p. 187-188 2 p.

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

    2. A Pragmatic Implementation of Monotone Priority Queues

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

      Research output: Contribution to journal › Journal article › Research

    3. A Space Saving Trick for Directed Dynamic Transitive Closure and Shortest Path Algorithms

      King, V. & Thorup, Mikkel, 2001, Proceedings of the 7th Annual International Computing and Combinatorics Conference (COCOON), LNCS 2108. p. 268-277 10 p.

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

    4. Published

      A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing

      Houen, J. B. T. & Thorup, Mikkel, 2023, 50th International Colloquium on Automata, Languages, and Programming, ICALP 2023. Etessami, K., Feige, U. & Puppis, G. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 76. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 261).

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

    5. A hybrid genetic algorithm for the weight setting problem in OSPF/IS-IS routing

      Buriol, L. S., Resende, M. G. C., Ribeiro, C. C. & Thorup, Mikkel, 2005, In: Networks. 46, 1, p. 36-56 21 p.

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

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

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

    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. Algorithms and Estimators for Accurate Summarization of Internet Traffic

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2007, Proceedings the ACM Internet Measurement Conference (IMC). Association for Computing Machinery, p. 265-278 14 p.

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

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

    11. All Structured Programs have Small Tree Width and Good Register Allocation

      Thorup, Mikkel, 1998, In: Information and Computation. 142, 2, p. 159-181 23 p.

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

    12. Ambiguity for incremental parsing and evaluation

      Thorup, Mikkel, 1992, Oxford university computing laboratory.

      Research output: Working paper › Research

    13. An $O(loglog n)$ Priority Queue

      Thorup, Mikkel, 1995.

      Research output: Working paper › Research

    14. An $O(nlog n)$ Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

      Cole, R., Farach, M., Hariharan, R., Przytycka, T. & Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 5, p. 1385-1404 20 p.

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

    15. An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

      Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2000, Proceedings of the 2nd Workshop on Algorithms Engineering and Experiments (ALENEX). p. 59-78 20 p.

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

    16. An Experimental Study of Poly-Logarithmic Fully-Dynamic Connectivity Algorithms

      Iyer, R. D., Karger, D., Rahul, H. S. & Thorup, Mikkel, 2001, In: ACM Journal of Experimental Algorithmics. 6, p. Article 4

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

    17. Approximate Distance Oracles

      Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 33nd ACM Symposium on the Theory of Computing (STOC). ACM, p. 183-192 10 p.

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

    18. Approximate Distance Oracles

      Thorup, Mikkel & Zwick, U., 2005, In: jacm. 52, 1, p. 1-24 24 p.

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

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

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

    21. Published

      Bottleneck paths and trees and deterministic graphical games

      Chechik, S., Kaplan, H., Thorup, Mikkel, Zamir, O. & Zwick, U., 2016, 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Ollinger, N. & Vollmer, H. (eds.). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, p. 1-13 13 p. 27. (Leibniz International Proceedings in Informatics, Vol. 47).

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

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

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

    24. Charging from sampled network usage

      Duffield, N., Lund, C. & Thorup, Mikkel, 2001, Proceedings of the 1st ACM SIGCOMM Internet Measurement Workshop (IMW). p. 245-256 12 p.

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

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

    26. Published

      Coloring 3-colorable graphs with less than n1/5 colors

      Kawarabayashi, K. & Thorup, Mikkel, Mar 2017, In: Journal of the ACM. 64, 1, 23 p., 4.

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

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

    28. Combinatorial power in multimedia processors

      Thorup, Mikkel, 2003, In: Operating Systems Review. 31, 5, p. 5-11 7 p.

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

    29. Compact Oracles for Approximate Distances around Obstacles in the Plane

      Thorup, Mikkel, 2007, Proceedings of the 15th European Symposium on Algorithms (ESA), LNCS 4698. p. 383-394 12 p. (Lecture notes in computer science, Vol. 4698).

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

    30. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

      Thorup, Mikkel, 2001, Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 242-251 10 p.

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

    31. Compact Oracles for Reachability and Approximate Distances in Planar Digraphs

      Thorup, Mikkel, 2004, In: Journal of the ACM. 51, 6, p. 993-1024 32 p.

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

    32. Compact Routing Schemes

      Thorup, Mikkel & Zwick, U., 2001, Proceedings of the 13nd ACM Symposium on the Parallel Algorithms and Architectures (SPAA). p. 1-10 10 p.

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

    33. Published

      Compact cactus representations of all non-trivial min-cuts

      Lo, O. H. S., Schmidt, J. M. & Thorup, Mikkel, 2021, In: Discrete Applied Mathematics. 303, p. 296-304

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

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

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

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

    37. Confidence Intervals for Priority Sampling

      Thorup, Mikkel, 2006, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). p. 252-263 12 p.

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

    38. Confident estimation for multistage measurement sampling and aggregation

      Cohen, E., Duffield, N., Lund, C. & Thorup, Mikkel, 2008, Proceedings the ACM IFIP Conference on Measurement and Modeling of Computer Systems (SIGMETRICS/Performance). ACM, p. 109-120 12 p.

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

    39. Published

      Confirmation sampling for exact nearest neighbor search

      Christiani, T., Pagh, R. & Thorup, Mikkel, 2020, Similarity Search and Applications - 13th International Conference, SISAP 2020, Proceedings. Satoh, S., Vadicamo, L., Carrara, F., Zimek, A., Bartolini, I., Aumüller, M., Jonsson, B. P. & Pagh, R. (eds.). Springer, p. 97-110 14 p. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Vol. 12440 LNCS).

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

    40. Published

      Consistent Hashing with bounded loads

      Mirrokni, V., Thorup, Mikkel & Zadimoghaddam, M., 2018, Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms. Czumaj, A. (ed.). Society for Industrial and Applied Mathematics, p. 587-604 18 p.

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

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

    42. Controlled grammatic ambiguity

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

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

    43. Decremental dynamic connectivity

      Thorup, Mikkel, 1999, In: Journal of Algorithms. 33, 2, p. 229-243 15 p.

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

    44. Decremental dynamic connectivity

      Thorup, Mikkel, 1997, Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 305-313 9 p.

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

    45. Deterministic Constructions of Approximate Distance Oracles and Spanners

      Roditty, L., Thorup, Mikkel & Zwick, U., 2005, Proceedings of the 32th International Colloquium on Automata Languages, and Programming (ICALP), LNCS 3580. p. 261-272 12 p. (Lecture notes in computer science, Vol. 3580).

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

    46. Published

      Deterministic Edge Connectivity in Near-Linear Time

      Kawarabayashi, K. & Thorup, Mikkel, 2019, In: Journal of the ACM. 66, 1, p. 1-50 4.

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

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

    48. Diameter and distance in dynamic trees

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

      Research output: Working paper › Research

    49. Published

      Dijkstra’s Single Source Shortest Path Algorithm

      Thorup, Mikkel, 2022, Edsger Wybe Dijkstra: His Life,Work, and Legacy. Apt, K. R. & Hoare, T. (eds.). ACM, p. 21-26

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

    88. Finding dominators in linear time

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

      Research output: Working paper › Research

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

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

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

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

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

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

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

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

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

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

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

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

    ID: 34257574