Anders Aamand
Postdoc
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
11 - 11 out of 11Page size: 10
- Published
Fast hashing with strong concentration bounds
Aamand, Anders, Knudsen, J. B. T., 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
ID: 388255807
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 -
52
downloads
No Repetition: Fast Streaming with Highly Concentrated Hashing
Research output: Working paper › Research
Published -
43
downloads
One-wasy trail orientation
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published