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: 10
- 2022
- Published
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Aamand, A., Das, D., Kipouridis, Evangelos, Knudsen, J. B. T., Rasmussen, Peter Michael Reichstein & Thorup, Mikkel, 2022, In: Proceedings of the VLDB Endowment. 15, 13, p. 3989-4001Research output: Contribution to journal › Conference article › Research › peer-review
- Published
Tiling with Squares and Packing Dominos in Polynomial Time
Aamand, Anders, Abrahamsen, Mikkel, Ahle, T. & Rasmussen, Peter Michael Reichstein, 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
ID: 135855095
Most downloads
-
96
downloads
Fast hashing with strong concentration bounds
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published -
68
downloads
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
Research output: Contribution to journal › Conference article › Research › peer-review
Published -
60
downloads
No Repetition: Fast Streaming with Highly Concentrated Hashing
Research output: Working paper › Research
Published