Peter Michael Reichstein Rasmussen
PhD Student
Department of Computer Science
Universitetsparken 1, 2100 København Ø
ORCID: 0000-0001-9219-8410
1 - 2 out of 2Page size: 500
- 2023
- 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
- 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
ID: 135855095
Most downloads
-
88
downloads
Fast hashing with strong concentration bounds
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
53
downloads
No Repetition: Fast Streaming with Highly Concentrated Hashing
Research output: Working paper
Published -
29
downloads
Classifying convex bodies by their contact and intersection graphs
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published