Anders Aamand
Postdoc
Algorithms and Complexity
Universitetsparken 1
2100 København Ø
1 - 1 out of 1Page size: 500
- 2019
- Published
Non-empty Bins with Simple Tabulation Hashing
Aamand, Anders & Thorup, Mikkel, 2 Jan 2019, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms. Chan, T. M. (ed.). Society for Industrial and Applied Mathematics, p. 2498-2512Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research
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 -
42
downloads
One-wasy trail orientation
Research output: Chapter in Book/Report/Conference proceeding › Article in proceedings › Research › peer-review
Published