Samarbejde og topforskningsområder i de sidste fem år
Seneste eksterne samarbejde på lande-/områdeniveau. Dyk ned i detaljerne ved at klikke på prikkerne eller
Publikation
-
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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-17 6. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 261).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil4 Citationer (Scopus)29 Downloads (Pure) -
Tiling with Squares and Packing Dominos in Polynomial Time
Aamand, A., Abrahamsen, M., Rasmussen, P. M. R. & Ahle, T. D., 2023, I: ACM Transactions on Algorithms. 19, 3, s. 1-28 30.Publikation: Bidrag til tidsskrift › Tidsskriftartikel › Forskning › peer review
Åben adgangFil3 Citationer (Scopus)45 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, I: Proceedings of the VLDB Endowment. 15, 13, s. 3989-4001Publikation: Bidrag til tidsskrift › Konferenceartikel › Forskning › peer review
Åben adgangFil1 Citationer (Scopus)126 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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 1. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 224).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil1 Citationer (Scopus)68 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. (red.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 16 s. 3. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 189).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil2 Citationer (Scopus)68 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. (red.). Association for Computing Machinery, Inc., s. 396-407Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil6 Citationer (Scopus)49 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. (red.). Schloss Dagstuhl - Leibniz-Zentrum für Informatik, s. 1-10 6. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 163).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil1 Citationer (Scopus)57 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. (red.). Association for Computing Machinery, s. 1265-1278 (Proceedings of the Annual ACM Symposium on Theory of Computing).Publikation: Bidrag til bog/antologi/rapport › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil5 Citationer (Scopus)137 Downloads (Pure)