Department of Computer Science

Read more
1 - 25 out of 1,697Page size: 25
Sort by: 1st author
  1. 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 proceeding › Article in proceedings › Research

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

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

  4. Published

    Tiling with Squares and Packing Dominos in Polynomial Time

    Aamand, A., Abrahamsen, Mikkel, Rasmussen, Peter Michael Reichstein & Ahle, T. D., 2023, In: ACM Transactions on Algorithms. 19, 3, p. 1-28 30.

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

  5. Published

    Tiling with Squares and Packing Dominos in Polynomial Time

    Aamand, A., Abrahamsen, Mikkel, Ahle, T. & Rasmussen, Peter Michael Reichstein, 2022, 38th International Symposium on Computational Geometry, SoCG 2022. Goaoc, X. & Kerber, M. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 224).

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

  6. Published

    Classifying convex bodies by their contact and intersection graphs

    Aamand, A., Abrahamsen, Mikkel, Houen, Jakob Bæk Tejs & Rasmussen, Peter Michael Reichstein, 2021, 37th International Symposium on Computational Geometry, SoCG 2021. Buchin, K. & de Verdiere, E. C. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 p. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 189).

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

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

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

  9. Published

    Popular conjectures as a barrier for dynamic planar graph algorithms

    Abboud, A. & Dahlgaard, S., 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS). IEEE, p. 477-486 10 p.

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

  10. Published

    X-WikiRE: A Large, Multilingual Resource for Relation Extraction as Machine Comprehension

    Abdou, M., Sas, C., Aralikatte, R., Augenstein, Isabelle & Søgaard, Anders, 2019, Proceedings of the 2nd Workshop on Deep Learning Approaches for Low-Resource NLP (DeepLo 2019). Association for Computational Linguistics, p. 265-274

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

  11. Published

    Numerical methods for linear complementarity problems in physics-based animation

    Abel, S. M. N. & Erleben, Kenny, 2015, Morgan & Claypool Publishers. 159 p. (Synthesis Lectures on Computer Graphics and Animation; No. 1, Vol. 7).

    Research output: Book/Report › Compendium/lecture notes › Education

  12. Published

    Euclidean TSP between two nested convex obstacles

    Abrahamsen, J., Shokoufandeh, A. & Winter, Pawel, 2005, In: Information Processing Letters. 95, p. 370-375

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

  13. Published

    Best laid plans of lions and men

    Abrahamsen, Mikkel, Holm, Jacob, Rotenberg, E. & Wulff-Nilsen, Christian, 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 6. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  14. Published

    Irrational Guards are Sometimes Needed

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-15 3. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 77).

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

  15. Published

    Near-Optimal Induced Universal Graphs for Bounded Degree Graphs

    Abrahamsen, Mikkel, Alstrup, Stephen, Holm, Jacob, Knudsen, M. B. T. & Stöckel, M., 2017, 44th International Colloquium on Automata, Languages, and Programming (ICALP 201. Chatzigiannaki, I., Indyk, P., Kuhn, F. & Muscholl, A. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-14 128. (Leibniz International Proceedings in Informatics (LIPIcs), Vol. 80).

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

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

  17. Published

    Outer common tangents and nesting of convex hulls in linear time and constant workspace

    Abrahamsen, Mikkel & Walczak, B., 2016, 24th Annual European Symposium on Algorithms (ESA 2016). Sankowski, P. & Zaroliagis, C. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 57).

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

  18. Published

    Constructing Concise Convex Covers via Clique Covers

    Abrahamsen, Mikkel, Meyling, William Bille & Nusser, André Fritz, 2023, 39th International Symposium on Computational Geometry, SoCG 2023. Chambers, E. W. & Gudmundsson, J. (eds.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, p. 1-9 66. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 258).

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

  19. Published

    The art gallery problem is ∃ ℝ-complete

    Abrahamsen, Mikkel, Adamaszek, A. & Miltzow, T., 2018, STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing. Association for Computing Machinery, p. 65-73

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

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

  21. Published

    Minimum perimeter-sum partitions in the plane

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 15 p. 4. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  22. Published

    Spiral toolpaths for high-speed machining of 2d pockets with or without islands

    Abrahamsen, Mikkel, 2015, Proceedings of the ASME 2015 International Design Engineering Technical Conferences & Computers and Information in Engineering Conference IDETC/CIE 2015. American Society of Mechanical Engineers, Vol. 2B. 10 p. DETC2015-46255

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

  23. Published

    An optimal algorithm for the separating common tangents of two polygons

    Abrahamsen, Mikkel, 2015, In: Leibniz International Proceedings in Informatics. 34, p. 198-208 11 p.

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

  24. Published

    Range-clustering queries

    Abrahamsen, Mikkel, de Berg, M., Buchin, K., Mehr, M. & Mehrabi, A. D., 2017, 33rd International Symposium on Computational Geometry (SoCG 2017). Aronov, B. & Katz, M. J. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 16 p. 5. (Leibniz International Proceedings in Informatics, Vol. 77).

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

  25. Published

    An optimal algorithm computing edge-to-edge visibility in a simple polygon

    Abrahamsen, Mikkel, 2013, Proceedings of the 25th Canadian Conference on Computational Geometry: CCCG 2013. p. 157-162 6 p.

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

Previous 1 2 3 4 5 6 7 8 ...68 Next