Anders Aamand
Anders Aamand
University of Copenhagen, Department of Computer Science, BARC
Verified email at
Cited by
Cited by
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
A Aamand, P Indyk, A Vakilian
arXiv preprint arXiv:1908.05198, 2019
Power of Choices with Simple Tabulation
A Aamand, MBT Knudsen, M Thorup
arXiv preprint arXiv:1804.09684, 2018
Classifying convex bodies by their contact and intersection graphs
A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen
arXiv preprint arXiv:1902.01732, 2019
On Sums of Monotone Random Integer Variables
A Aamand, N Alon, JBT Knudsen, M Thorup
arXiv preprint arXiv:2104.03721, 2021
Disks in Curves of Bounded Convex Curvature
A Aamand, M Abrahamsen, M Thorup
The American Mathematical Monthly 127 (7), 579-593, 2020
Fast hashing with strong concentration bounds
A Aamand, JBT Knudsen, MBT Knudsen, PMR Rasmussen, M Thorup
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing …, 2020
No Repetition: Fast Streaming with Highly Concentrated Hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
arXiv preprint arXiv:2004.01156, 2020
One-Way Trail Orientations
A Aamand, N Hjuler, J Holm, E Rotenberg
arXiv preprint arXiv:1708.07389, 2017
Load balancing with dynamic set of balls and bins
A Aamand, JBT Knudsen, M Thorup
Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing …, 2021
Tiling with Squares and Packing Dominos in Polynomial Time
A Aamand, M Abrahamsen, TD Ahle, PMR Rasmussen
arXiv preprint arXiv:2011.10983, 2020
Simple Hashing-Based Algorithms with Strong Theoretical Guarantees
A Aamand
School of The Faculty of Science, University of Copenhagen, 2020
Non-empty bins with simple tabulation hashing
A Aamand, M Thorup
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
Count-Min: Optimal Estimation and Tight Error Bounds using Empirical Error Distributions
A Aamand, P Indyk, A Vakilian
The system can't perform the operation now. Try again later.
Articles 1–13