Mikkel Thorup

Mikkel Thorup

Professor

Member of:

    ORCID: 0000-0001-5237-1709

    Publication year:
    All
    126 - 150 out of 241Page size: 25
    1. 2007

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

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

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

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

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

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

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

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

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

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

    12. 2008

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

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

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

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

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

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

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

    20. 2009

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

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

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

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

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

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

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

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

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

    26. Maximum overhang

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

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

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

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

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

    28. String hashing for linear probing

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

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

    Previous 12 3 4 5 6 7 8 9 10 Next

    ID: 34257574