Mikkel Thorup

Mikkel Thorup

Professor

Member of:


    1. 2023
    2. Published

      A Sparse Johnson-Lindenstrauss Transform Using Fast Hashing

      Houen, Jakob Bæk Tejs & 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 proceedingArticle in proceedingsResearchpeer-review

    3. 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 journalJournal articlepeer-review

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

    5. Published

      How to Cut Corners and Get Bounded Convex Curvature

      Abrahamsen, Mikkel & Thorup, Mikkel, 2023, In: Discrete and Computational Geometry. 69, p. 1195–1231,

      Research output: Contribution to journalJournal articlepeer-review

    6. Published

      Locally Uniform Hashing

      Bercea, I. O., Beretta, Lorenzo, Klausen, Jonas Østergaard, Houen, Jakob Bæk Tejs & Thorup, Mikkel, 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society Press, p. 1440-1470

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

    7. Published

      Optimal Decremental Connectivity in Non-Sparse Graphs

      Aamand, A., Karczmarz, A., Łącki, J., Parotsidis, N., Rasmussen, Peter Michael Reichstein & 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, p. 1-17 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 261).

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

    8. Published

      Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming

      Kacham, P., Pagh, R., Thorup, Mikkel & Woodruff, D. P., 2023, Proceedings - 2023 IEEE 64th Annual Symposium on Foundations of Computer Science, FOCS 2023. IEEE Computer Society Press, p. 1515-1550 (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).

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

    9. Published

      Special Section on the Fifty-Ninth Annual IEEE Symposium on Foundations of Computer Science (2018)

      Boyle, E., Cohen-Addad, V., Kolla, A. & Thorup, Mikkel, 2023, In: SIAM Journal on Computing. 52, 6, p. FOCS18 - i

      Research output: Contribution to journalEditorial

    10. 2022
    11. Published

      Understanding the Moments of Tabulation Hashing via Chaoses

      Houen, Jakob Bæk Tejs & Thorup, Mikkel, Jul 2022, 49th EATCS International Conference on Automata, Languages, and Programming, ICALP 2022. Bojanczyk, M., Merelli, E. & Woodruff, D. P. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-19 74. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 229).

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

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

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

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

    15. Published

      Improved Utility Analysis of Private CountSketch

      Pagh, Rasmus & Thorup, Mikkel, 2022, Advances in Neural Information Processing Systems 35 (NeurIPS 2022). NeurIPS Proceedings, 13 p. (Advances in Neural Information Processing Systems, Vol. 35).

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

    16. Published

      No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing

      Aamand, A., Das, D., Kipouridis, Evangelos, Knudsen, J. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2022, In: Proceedings of the VLDB Endowment. 15, 13, p. 3989-4001

      Research output: Contribution to journalConference articlepeer-review

    17. Published

      On sums of monotone random integer variables

      Aamand, A., Alon, N., Houen, Jakob Bæk Tejs & Thorup, Mikkel, 2022, In: Electronic Communications in Probability. 27, p. 1-8 64.

      Research output: Contribution to journalJournal articlepeer-review

    18. Published

      Reconstructing the Tree of Life (Fitting Distances by Tree Metrics) (Invited Paper)

      Thorup, Mikkel, 2022, 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022). Springer, p. 3:1--3:2 (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 227).

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    19. 2021
    20. 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 journalJournal articlepeer-review

    21. Published

      Load balancing with dynamic set of balls and bins

      Aamand, A., Knudsen, J. B. T. & Thorup, Mikkel, 2021, STOC 2021 - Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing. Khuller, S. & Williams, V. V. (eds.). Association for Computing Machinery, Inc, p. 1262-1275 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    22. 2020
    23. 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 proceedingArticle in proceedingsResearchpeer-review

    24. Published

      Disks in Curves of Bounded Convex Curvature

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

      Research output: Contribution to journalJournal articlepeer-review

    25. Published

      Fast hashing with strong concentration bounds

      Aamand, A., Houen, Jakob Bæk Tejs, 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 proceedingArticle in proceedingsResearchpeer-review

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

    27. Published
    28. Published

      Three-in-a-tree in near linear time

      Lai, K. Y., Lu, H. I. & 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. 1279-1292 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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

    29. 2019
    30. Published

      Non-empty Bins with Simple Tabulation Hashing

      Aamand, A. & Thorup, Mikkel, 2 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). Society for Industrial and Applied Mathematics, p. 2498-2512

      Research output: Chapter in Book/Report/Conference proceedingArticle in proceedingsResearch

    31. 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 journalJournal articlepeer-review

    32. 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 journalJournal articlepeer-review

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

    34. Published

      Hardness of bichromatic closest pair with Jaccard similarity

      Pagh, R., Stausholm, N. M. & Thorup, Mikkel, 2019, 27th Annual European Symposium on Algorithms, ESA 2019. Bender, M. A., Svensson, O. & Herman, G. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 13 p. 74. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 144).

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

    35. Published

      Heavy hitters via cluster-preserving clustering

      Larsen, K. G., Nelson, J., Nguyễn, H. L. & Thorup, Mikkel, 2019, In: Communications of the ACM. 62, 8, p. 95-100

      Research output: Contribution to journalJournal articlepeer-review

    36. Published

      Random k-out subgraph leaves only O(n/k) inter-component edges

      Holm, Jacob, King, V., Thorup, Mikkel, Zamir, O. & Zwick, U., 2019, Proceedings - 2019 IEEE 60th Annual Symposium on Foundations of Computer Science, FOCS 2019. IEEE, 14 p. 8948658

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

    37. 2018
    38. Published

      Power of d choices with simple tabulation

      Aamand, A., Knudsen, M. B. T. & Thorup, Mikkel, 1 Jul 2018, 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Kaklamanis, C., Marx, D., Chatzigiannakis, I. & Sannella, D. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 14 p. 5. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 107).

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

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

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

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

    42. Published

      Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time

      Goranci, G., Henzinger, M. & Thorup, Mikkel, 2018, In: ACM Transactions on Algorithms. 14, 2, 17.

      Research output: Contribution to journalJournal articlepeer-review

    43. Published

      Proceedings, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS)

      Thorup, Mikkel (ed.), 2018, IEEE. 996 p.

      Research output: Book/ReportBookpeer-review

    44. Published

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

      Thorup, Mikkel, 2018, In: SIAM Journal on Computing. 47, 6, p. 2510-2526

      Research output: Contribution to journalJournal articlepeer-review

    45. Published

      The entropy of backwards analysis

      Knudsen, M. B. T. & 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. 867-880 14 p.

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

    46. Published

      Wireless coverage prediction via parametric shortest paths

      Applegate, D., Archer, A., Johnson, D. S., Nikolova, E., Thorup, Mikkel & Yang, G., 2018, Proceedings of the Eighteenth ACM International Symposium on Mobile Ad Hoc Networking and Computing, Mobihoc '18 . ACM, p. 221-230

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

    47. 2017
    48. 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 journalJournal articlepeer-review

    49. 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 journalJournal articlepeer-review

    50. 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 proceedingArticle in proceedingsResearch

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

    52. Published

      Practical hash functions for similarity estimation and dimensionality reduction

      Dahlgaard, S., Knudsen, M. B. T. & Thorup, Mikkel, 2017, Neural Information Processing Systems 2017. Guyon, I., Luxburg, U. V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S. & Garnett, R. (eds.). NIPS Proceedings, 11 p. (Advances in Neural Information Processing Systems, Vol. 30).

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

    53. 2016
    54. 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 proceedingArticle in proceedingsResearchpeer-review

    55. 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 proceedingConference abstract in proceedingsResearchpeer-review

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

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

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

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

    60. 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 journalJournal articlepeer-review

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

    62. 2015
    63. 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 proceedingArticle in proceedingsResearchpeer-review

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

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

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

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

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

    69. Published

      RAM-efficient external memory sorting

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

      Research output: Contribution to journalJournal articlepeer-review

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

    71. 2014
    72. 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 journalJournal articlepeer-review

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

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

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

    76. 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 journalJournal articlepeer-review

    77. 2013
    78. 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 proceedingArticle in proceedingsResearchpeer-review

    79. 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 journalComment/debate

    80. 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 journalJournal articlepeer-review

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

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

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

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

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

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

    87. 2012
    88. 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 proceedingArticle in proceedingsResearchpeer-review

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

    90. 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 journalJournal articlepeer-review

    91. 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 journalJournal articlepeer-review

    92. 2011
    93. 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 proceedingArticle in proceedingsResearchpeer-review

    94. 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 journalJournal articlepeer-review

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

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

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

    98. 2010
    99. 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 proceedingArticle in proceedingsResearchpeer-review

    100. 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 journalJournal articlepeer-review

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

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

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

    104. 2009
    105. 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 journalJournal articlepeer-review

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

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

    108. 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 journalJournal articlepeer-review

    109. 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 journalJournal articlepeer-review

    110. 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 journalJournal articlepeer-review

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

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

    113. 2008
    114. 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 journalJournal articlepeer-review

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

    116. Maximum overhang

      Paterson, M., Peres, Y., Thorup, Mikkel, Winkler, P. & Zwick, U., 2008, Proceedings of the 19th ACM-SIAM Symposium on Discrete Algorithms (SODA). SIAM, p. 756-765 10 p.

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

    117. Minimum k-way cuts via deterministic greedy tree packing

      Thorup, Mikkel, 2008, Proceedings of the 40th Annual ACM Symposium on Theory of Computing (STOC). ACM, p. 159-166 8 p.

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

    118. Oracles for Distances Avoiding a Failed Node or Link

      Demetrescu, C., Thorup, Mikkel, Chowdhury, R. A. & Ramachandran, V., 2008, In: sicomp. 37, 5, p. 1299-1318 20 p.

      Research output: Contribution to journalJournal articlepeer-review

    119. Roundtrip Spanners and Roundtrip Routing in Directed Graphs

      Roditty, L., Thorup, Mikkel & Zwick, U., 2008, In: ACM Transactions on Algorithms. 4, 3, p. Article 29

      Research output: Contribution to journalJournal articlepeer-review

    120. Speeding up Dynamic Shortest-Path Algorithms

      Buriol, L. S., Resende, M. G. C. & Thorup, Mikkel, 2008, In: I N F O R M S Journal on Computing. 20, 2, p. 191-204 14 p.

      Research output: Contribution to journalJournal articlepeer-review

    121. 2007
    122. 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 proceedingArticle in proceedingsResearchpeer-review

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

    124. 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 journalJournal articlepeer-review

    125. Equivalence between Priority Queues and Sorting

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

      Research output: Contribution to journalJournal articlepeer-review

    126. Fully-Dynamic Min-Cut

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

      Research output: Contribution to journalJournal articlepeer-review

    127. On the variance of subset sum estimation

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

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

    128. Planning for Fast Connectivity Updates

      Patracu, M. & Thorup, Mikkel, 2007, Proceedings of the 48th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, p. 263-271 9 p.

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

    129. Priority sampling for estimation of arbitrary subset sums

      Duffield, N., Lund, C. & Thorup, Mikkel, 2007, In: Journal of the ACM. 54, 6, p. Article 32

      Research output: Contribution to journalJournal articlepeer-review

    130. Randomization Does Not Help Searching Predecessors

      Patracu, M. & Thorup, Mikkel, 2007, Proceedings of the 18th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 555-564 10 p.

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

    131. Sketching Unaggregated Data Streams for Subpopulation-Size Queries

      Cohen, E., Duffield, N., Kaplan, H., Lund, C. & Thorup, Mikkel, 2007, Proceedings of the 26th Annual ACM Symposium on Principles of Database Systems (PODS). Association for Computing Machinery, p. 253-262 10 p.

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

    132. Survivable IP network design with OSPF routing

      Buriol, L. S., Resende, M. G. C. & Thorup, Mikkel, 2007, In: Networks. 49, 1, p. 51-64 14 p.

      Research output: Contribution to journalJournal articlepeer-review

    133. 2006
    134. 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 proceedingArticle in proceedingsResearchpeer-review

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

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

      Patracu, M. & Thorup, Mikkel, 2006, Proceedings of the 47th IEEE Symposium on Foundations of Computer Science (FOCS). p. 646-654 9 p.

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

    137. Melding Priority Queues

      Mendelson, R., Tarjan, R., Thorup, Mikkel & Zwick, U., 2006, In: ACM Transactions on Algorithms. 2, 4, p. 535-557 23 p.

      Research output: Contribution to journalConference articlepeer-review

    138. Spanners and emulators with sublinear distance errors

      Thorup, Mikkel & Zwick, U., 2006, Proceedings of the 17th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 802-809 8 p.

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

    139. Time-Space Trade-Offs for Predecessor Search

      Patracu, M. & Thorup, Mikkel, 2006, Proceedings of the 38th Annual ACM Symposium on Theory of Computing (STOC). p. 232-240 9 p.

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

    140. 2005
    141. 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 journalJournal articlepeer-review

    142. Approximate Distance Oracles

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

      Research output: Contribution to journalJournal articlepeer-review

    143. 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 journalJournal articlepeer-review

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

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

    146. 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 journalJournal articlepeer-review

    147. Learn More, Sample Less: Control of Volume and Variance in Network Measurement

      Duffield, N., Lund, C. & Thorup, Mikkel, 2005, In: IEEE Transactions on Information Theory. 51, 5, p. 1756-1775 20 p.

      Research output: Contribution to journalJournal articlepeer-review

    148. Maintaining information in fully dynamic trees with top trees

      Alstrup, Stephen, Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2005, In: ACM Transactions on Algorithms (TALG). 1, 2, p. 243-264 22 p.

      Research output: Contribution to journalJournal articlepeer-review

    149. Optimal Combination of Sampled Network Measurements

      Duffield, N., Lund, C. & Thorup, Mikkel, 2005, Proceedings the ACM Internet Measurement Conference (IMC). p. 91-104 14 p.

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

    150. Quick k-Median, k-Center, and Facility Location for Sparse Graphs

      Thorup, Mikkel, 2005, In: sicomp. 34, 2, p. 405-432 28 p.

      Research output: Contribution to journalJournal articlepeer-review

    151. Published

      Union-find with constant time deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T., Thorup, Mikkel & Zwick, U., 2005, Automata, Languages and Programming (ICALP). Springer, p. 78-89 12 p.

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

    152. Worst-Case Update Times for Fully-Dynamic All-Pairs Shortest Paths

      Thorup, Mikkel, 2005, Proceedings of the 37th Annual ACM Symposium on Theory of Computing (STOC). Association for Computing Machinery, p. 112-119 8 p.

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

    153. 2004
    154. 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 journalJournal articlepeer-review

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

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

    157. Increasing Internet Capacity Using Local Search

      Fortz, B. & Thorup, Mikkel, 2004, In: Computational Optimization and Applications. 29, 1, p. 13-48 36 p.

      Research output: Contribution to journalJournal articlepeer-review

    158. Integer priority queues with decrease key in constant time and the single source shortest paths problem

      Thorup, Mikkel, 2004, In: Journal of Computer and System Sciences. 69, 3, p. 330-353 24 p.

      Research output: Contribution to journalJournal articlepeer-review

    159. Melding Priority Queues

      Mendelson, R., Tarjan, R., Thorup, Mikkel & Zwick, U., 2004, Proceedings of the 9th Scandinavian Workshop on Algorithm Theory (SWAT). Springer, p. 223-235 13 p. (Lecture notes in computer science, Vol. 3111).

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

    160. OPT versus LOAD in dynamic storage allocation

      Buchsbaum, A. L., Karloff, H. J., Kenyon, C., Reingold, N. & Thorup, Mikkel, 2004, In: SIAM Journal on Computing. 33, 3, p. 632-646 15 p.

      Research output: Contribution to journalJournal articlepeer-review

    161. On Adaptive Integer Sorting

      Pagh, A., Pagh, R. & Thorup, Mikkel, 2004, Proceedings of the 12th European Symposium on Algorithms (ESA), LNCS 3221. Springer, p. 556-579 24 p. (Lecture notes in computer science, Vol. 3221).

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

    162. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

      Karger, D., Klein, P., Stein, C., Thorup, Mikkel & Young, N., 2004, In: Mathematics of Operations Research. 29, 3, p. 436-461 26 p.

      Research output: Contribution to journalJournal articlepeer-review

    163. Tabulation Based 4-Universal Hashing with Applications to Second Moment Estimation

      Thorup, Mikkel & Zhang, Y., 2004. 10 p.

      Research output: Contribution to conferencePaperResearchpeer-review

    164. 2003
    165. Robust optimization of OSPF/IS-IS weights

      Fortz, B. & Thorup, Mikkel, 1 Oct 2003, Proceedings of the International Network Optimization Conference (INOC). Ben-Ameur, W. & Petrowski, A. (eds.). p. 225-230 6 p.

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

    166. OSPF Areas Considered Harmful

      Thorup, Mikkel, 1 Apr 2003

      Research output: Other contributionResearch

    167. Combinatorial power in multimedia processors

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

      Research output: Contribution to journalJournal articlepeer-review

    168. Integer priority queues with decrease key in constant time and the single source shortest paths problem

      Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 149-158 10 p.

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

    169. Load optimal MPLS routing with N+M labels

      Applegate, D. & Thorup, Mikkel, 2003, Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM). p. 555-565 11 p. (I E E E Infocom. Proceedings).

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

    170. Meldable RAM priority queues and minimum directed spanning trees

      Mendelson, R., Thorup, Mikkel & Zwick, U., 2003, Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 40-48 9 p.

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

    171. OPT versus LOAD in dynamic storage allocation

      Buchsbaum, A. L., Karloff, H. J., Kenyon, C., Reingold, N. & Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 649-658 10 p.

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

    172. On AC^0Implementations of Fusion Trees and Atomic Heaps

      Thorup, Mikkel, 2003, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 699-707 9 p.

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

    173. Performance of estimated traffic matrices in traffic engineering

      Roughan, M., Thorup, Mikkel & Zhang, Y., 2003, Proceedings of the International Conference on Measurements and Modeling of Computer Systems (SIGMETRICS). p. 326-327 2 p.

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

    174. Quick and Good Facility Location

      Thorup, Mikkel, 2003, Proceedings of the 14th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 178-185 8 p.

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

    175. Space efficient dynamic stabbing with fast queries

      Thorup, Mikkel, 2003, Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC). p. 649-658 10 p.

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

    176. Traffic engineering with estimated traffic matrices

      Roughan, M., Thorup, Mikkel & Zhang, Y., 2003, Proceedings the ACM Internet Measurement Conference (IMC). p. 248-258 11 p.

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

    177. Tree based MPLS routing

      Gupta, A., Kumar, A. & Thorup, Mikkel, 2003, Proceedings of the 15th ACM Symposium on Parallel Algorithms (SPAA). Association for Computing Machinery, p. 193-199 7 p.

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

    178. Untangling the balancing and searching of balanced binary search trees

      Austern, M. H., Stroustrup, B., Thorup, Mikkel & Wilkinson, J., 2003, In: Software: Practice & Experience. 33, 13, p. 1273-1298 26 p.

      Research output: Contribution to journalJournal articlepeer-review

    179. Published

      Worst-case union-find with fast deletions

      Alstrup, Stephen, Gørtz, I. L., Rauhe, T. & Thorup, Mikkel, 2003.

      Research output: Working paperResearch

    180. 2002
    181. Traffic Engineering with Traditional IP Routing Protocols

      Fortz, B., Rexford, J. & Thorup, Mikkel, 1 Oct 2002, In: IEEE Communications Magazine. 40, 10, p. 118-124 7 p.

      Research output: Contribution to journalJournal articlepeer-review

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

    183. 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 journalJournal article

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

    185. Integer Sorting in O(nlog log n) Expected Time and Linear Space

      Han, Y. & Thorup, Mikkel, 2002, Proceedings of the 43nd IEEE Symposium on Foundations of Computer Science (FOCS). p. 135-144 10 p.

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

    186. On Distance Oracles and Routing in Graphs (Invited Talk)

      Thorup, Mikkel, 2002, Proceedings of the 10th Annual European Symposium on Algorithms (ESA), LNCS 2461. p. 4 1 p.

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

    187. Optimizing OSPF/IS-IS weights in a changing world

      Fortz, B. & Thorup, Mikkel, 2002, In: IEEE Journal on Selected Areas in Communications (Special Issue on Recent Advances on Fundamentals of Network Management). 20, 4, p. 756-767 12 p.

      Research output: Contribution to journalJournal articlepeer-review

    188. Oracles for Distances Avoiding a Link-Failure

      Demetrescu, C. & Thorup, Mikkel, 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 838-843 6 p.

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

    189. Properties and Prediction of Flow Statistics from Sampled Packet Streams

      Duffield, N., Lund, C. & Thorup, Mikkel, 2002, Proceedings of the 2nd ACM SIGCOMM Internet Measurement Workshop (IMW). p. 159-171 13 p.

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

    190. Randomized sorting in $O(nloglog n)$ time and linear space using addition, shift, and bit-wise Boolean operations

      Thorup, Mikkel, 2002, In: Journal of Algorithms. 42, 2, p. 205-230 26 p.

      Research output: Contribution to journalJournal articlepeer-review

    191. Roundtrip Spanners and Roundtrip Routing in Directed Graphs

      Roditty, L., Thorup, Mikkel & Zwick, U., 2002, Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 844-851 8 p.

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

    192. 2001
    193. 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 proceedingArticle in proceedingsResearchpeer-review

    194. 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 journalJournal articlepeer-review

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

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

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

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

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

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

    201. Poly-Logarithmic Deterministic Fully-Dynamic Algorithms for Connectivity, Minimum Spanning Tree, 2-Edge and Biconnectivity

      Holm, J., Lichtenberg, K. D. & Thorup, Mikkel, 2001, In: Journal of the ACM. 48, 4, p. 723-760 38 p.

      Research output: Contribution to journalJournal articlepeer-review

    202. Quick k-Median, k-Center, and Facility Location for Sparse Graphs

      Thorup, Mikkel, 2001, Proceedings of the 28th International Colloquium on Automata Languages, and Programming (ICALP), LNCS 2076. Springer, p. 249-260 12 p.

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

    203. 2000
    204. 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 journalJournal articlepeer-review

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

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

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

    208. Floats, Integers, and Single Source Shortest Paths

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

      Research output: Contribution to journalJournal articlepeer-review

    209. Generalized Dominators for Structured Programs

      Alstrup, Stephen, Lauridsen, P. W. & Thorup, Mikkel, 2000, In: Algorithmica. 27, 3, p. 244-253 10 p.

      Research output: Contribution to journalJournal articlepeer-review

    210. Internet Traffic Engineering by Optimizing OSPF Weights

      Fortz, B. & Thorup, Mikkel, 2000, Proceedings of the 19th IEEE INFOCOM - The Conference on Computer Communications. p. 519-528 10 p.

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

    211. Published

      Maintaining center and median in dynamic trees

      Alstrup, Stephen, Holm, Jacob & Thorup, Mikkel, 2000, Algorithm Theory-SWAT 2000. Springer Science+Business Media, Vol. 1851. p. 46-56 11 p. (Lecture notes in computer science).

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

    212. Near-optimal fully-dynamic graph connectivity

      Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 343-350 8 p.

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

    213. On RAM Priority Queues

      Thorup, Mikkel, 2000, In: SIAM Journal on Computing. 30, 1, p. 86-109 24 p.

      Research output: Contribution to journalJournal articlepeer-review

    214. 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 articlepeer-review

    215. Tight(er) Worst-case Bounds on Dynamic Searching and Priority Queues

      Andersson, A. & Thorup, Mikkel, 2000, Proceedings of the 32nd ACM Symposium on the Theory of Computing (STOC). p. 335-342 8 p.

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

    216. Published

      Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 2000, Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. p. 498-499 2 p.

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

    217. 1999
    218. Decremental dynamic connectivity

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

      Research output: Contribution to journalJournal articlepeer-review

    219. 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 journalJournal articlepeer-review

    220. Fusion trees can be implemented with AC^0 instructions only

      Andersson, A., Miltersen, P. B. & Thorup, Mikkel, 1999, In: Theoretical Computer Science. 215, 1-2, p. 337-344 8 p.

      Research output: Contribution to journalJournal articlepeer-review

    221. On the Approximability of Numerical Taxonomy (Fitting Distances by Tree Metrics)

      Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M. & Thorup, Mikkel, 1999, In: SIAM Journal on Computing. 28, 3, p. 1073 - 1085

      Research output: Contribution to journalJournal articlepeer-review

    222. Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut

      Karger, D., Klein, P., Stein, C., Thorup, Mikkel & Young, N., 1999, Proceedings of the 31st ACM Symposium on the Theory of Computing (STOC). p. 668-678 11 p.

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

    223. Undirected Single Source Shortest Paths with Positive Integer Weights in Linear Time

      Thorup, Mikkel, 1999, In: Journal of the ACM. 46, 3, p. 362-394 33 p.

      Research output: Contribution to journalJournal articlepeer-review

    224. Word encoding tree connectivity works

      Alstrup, Stephen, Secher, J. P. & Thorup, Mikkel, 1999, In: DIKU Report.

      Research output: Contribution to journalJournal article

    225. Århus-tung forskningspolitik skader (Læserbrev med journalistvalgt overskrift)

      Thorup, Mikkel, 1999, In: Computerworld. 10, p. 24 (hele siden)

      Research output: Contribution to journalJournal articlepeer-review

    226. 1998
    227. 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 journalJournal articlepeer-review

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

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

    230. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge and biconnectivity

      Holm, J., de Lichtenberg, K. & Thorup, Mikkel, 1998, Proceedings of the 30th ACM Symposium on the Theory of Computing (STOC). ACM, p. 79-89

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

    231. Published

      String Matching in Lempel-Ziv Compressed Strings

      Farach, M. & Thorup, Mikkel, 1998, In: Algorithmica. 20, 4, p. 388-404 17 p.

      Research output: Contribution to journalJournal articlepeer-review

    232. 1997
    233. 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 proceedingArticle in proceedingsResearchpeer-review

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

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

      Research output: Contribution to journalJournal articlepeer-review

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

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

    237. Published

      Randomized sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-Wise Boolean Operations

      Thorup, Mikkel, 1997, Proceedings 8th SODA AMC-SIAM . p. 352-359 8 p.

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

    238. Undirected single source shortest paths in linear time

      Thorup, Mikkel, 1997, Proceedings of the 38th IEEE Symposium on Foundations of Computer Science (FOCS). IEEE, p. 12-21

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

    239. 1996
    240. A Pragmatic Implementation of Monotone Priority Queues

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

      Research output: Contribution to journalJournal article

    241. Diameter and distance in dynamic trees

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

      Research output: Working paperResearch

    242. 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 articlepeer-review

    243. 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 articlepeer-review

    244. Finding dominators in linear time

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

      Research output: Working paperResearch

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

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

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

    248. On the Approximability of Numerical Taxonomy

      Agarwala, R., Bafna, V., Farach, M., Narayanan, B., Paterson, M. & Thorup, Mikkel, 1996, Proceedings of the 7th ACM-SIAM Symposium on Discrete Algorithms (SODA). p. 365-372 8 p.

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

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

    250. Static Dictionaries on AC^0 RAMs: Query time log n/log log n) is necessary and sufficient

      Andersson, A., Miltersen, P. B., Riis, S. & Thorup, Mikkel, 1996, Proceedings of the 37th IEEE Symposium on Foundations of Computer Science (FOCS). p. 441-450 10 p.

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

    251. 1995
    252. An $O(loglog n)$ Priority Queue

      Thorup, Mikkel, 1995.

      Research output: Working paperResearch

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

    254. 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 articlepeer-review

    255. Improved Sampling with Applications to Dynamic Graph Algorithms

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

      Research output: Working paperResearch

    256. 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 articlepeer-review

    257. Shortcutting planar diagraphs

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

      Research output: Contribution to journalJournal articlepeer-review

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

    259. 1994
    260. Controlled grammatic ambiguity

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

      Research output: Contribution to journalJournal articlepeer-review

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

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

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

    264. 1993
    265. 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

    266. Topics in Computation

      Thorup, Mikkel, 1993

      Research output: Book/ReportPh.D. thesis

    267. 1992
    268. Ambiguity for incremental parsing and evaluation

      Thorup, Mikkel, 1992, Oxford university computing laboratory.

      Research output: Working paperResearch

    269. 1991
    270. 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 articlepeer-review

    271. 1990
    272. 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

    273. 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 articlepeer-review

    ID: 34257574