Research output per year
Research output per year
Collaborations and top research areas from the last five years
Recent external collaboration on country/territory level. Dive into details by clicking on the dots or
Research output
-
Optimal Decremental Connectivity in Non-Sparse Graphs
Aamand, A., Karczmarz, A., Łącki, J., Parotsidis, N., Rasmussen, P. M. R. & Thorup, M., 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
Open AccessFile1 Citation (Scopus)12 Downloads (Pure) -
Tiling with Squares and Packing Dominos in Polynomial Time
Aamand, A., Abrahamsen, M., Rasmussen, P. M. R. & 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
Open AccessFile1 Citation (Scopus)7 Downloads (Pure) -
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Aamand, A., Das, D., Kipouridis, E., Knudsen, J. B. T., Rasmussen, P. M. R. & Thorup, M., 2022, In: Proceedings of the VLDB Endowment. 15, 13, p. 3989-4001Research output: Contribution to journal › Conference article › Research › peer-review
Open AccessFile1 Citation (Scopus)85 Downloads (Pure) -
Tiling with Squares and Packing Dominos in Polynomial Time
Aamand, A., Abrahamsen, M., Ahle, T. & Rasmussen, P. M. R., 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
Open AccessFile1 Citation (Scopus)17 Downloads (Pure) -
Classifying convex bodies by their contact and intersection graphs
Aamand, A., Abrahamsen, M., Knudsen, J. B. T. & Rasmussen, P. M. R., 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
Open AccessFile2 Citations (Scopus)37 Downloads (Pure) -
Support of closed walks and second eigenvalue multiplicity of graphs
McKenzie, T., Rasmussen, P. M. R. & Srivastava, N., 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. 396-407Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile4 Citations (Scopus)20 Downloads (Pure) -
Expander graphs are non-malleable codes
Rasmussen, P. M. R. & Sahai, A., 2020, 1st Conference on Information-Theoretic Cryptography, ITC 2020. Kalai, Y. T., Smith, A. D. & Wichs, D. (eds.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, p. 1-10 6. (Leibniz International Proceedings in Informatics, LIPIcs, Vol. 163).Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Open AccessFile1 Citation (Scopus)31 Downloads (Pure) -
Fast hashing with strong concentration bounds
Aamand, A., Knudsen, J. B. T., Knudsen, M. B. T., Rasmussen, P. M. R. & Thorup, M., 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
Open AccessFile4 Citations (Scopus)97 Downloads (Pure)