Department of Computer Science

Read more
1 - 10 out of 1,710Page size: 10
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

    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

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

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

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

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

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

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

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

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