Department of Computer Science

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

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

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

  4. 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/ReportCompendium/lecture notesEducation

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

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

  7. Published

    Non-empty Bins with Simple Tabulation Hashing

    Aamand, Anders & 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

  8. 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 journalJournal articleResearchpeer-review

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

  10. Published

    Fast hashing with strong concentration bounds

    Aamand, Anders, Knudsen, J. B. T., Knudsen, M. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2020, STOC 2020 - Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing. Makarychev, K., Makarychev, Y., Tulsiani, M., Kamath, G. & Chuzhoy, J. (eds.). Association for Computing Machinery, p. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).

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