Follow
Anders Aamand
Anders Aamand
University of Copenhagen, Department of Computer Science, BARC
Verified email at di.ku.dk
Title
Cited by
Cited by
Year
(Learned) Frequency Estimation Algorithms under Zipfian Distribution
A Aamand, P Indyk, A Vakilian
arXiv preprint arXiv:1908.05198, 2019
112019
Power of Choices with Simple Tabulation
A Aamand, MBT Knudsen, M Thorup
arXiv preprint arXiv:1804.09684, 2018
82018
(Optimal) Online Bipartite Matching with Predicted Degrees
A Aamand, JY Chen, P Indyk
arXiv e-prints, arXiv: 2110.11439, 2021
52021
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
42021
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
42020
Classifying convex bodies by their contact and intersection graphs
A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen
arXiv preprint arXiv:1902.01732, 2019
42019
Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks
A Aamand, J Chen, P Indyk, S Narayanan, R Rubinfeld, N Schiefer, ...
Advances in Neural Information Processing Systems 35, 27333-27346, 2022
32022
Disks in curves of bounded convex curvature
A Aamand, M Abrahamsen, M Thorup
The American Mathematical Monthly 127 (7), 579-593, 2020
32020
Non-empty bins with simple tabulation hashing
A Aamand, M Thorup
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
22019
One-Way Trail Orientations
A Aamand, N Hjuler, J Holm, E Rotenberg
arXiv preprint arXiv:1708.07389, 2017
22017
On sums of monotone random integer variables
A Aamand, N Alon, JBT Houen, M Thorup
Electronic Communications in Probability 27, 1-8, 2022
12022
Tiling with squares and packing dominos in polynomial time
A Aamand, M Abrahamsen, PMR Rasmussen, TD Ahle
ACM Transactions on Algorithms, 2020
12020
No Repetition: Fast Streaming with Highly Concentrated Hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
arXiv preprint arXiv:2004.01156, 2020
12020
Improved Space Bounds for Learning with Experts
A Aamand, JY Chen, HL Nguyen, S Silwal
arXiv preprint arXiv:2303.01453, 2023
2023
Online Sorting and Translational Packing of Convex Polygons
A Aamand, M Abrahamsen, L Beretta, L Kleist
Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms …, 2023
2023
(Optimal) Online Bipartite Matching with Degree Information
A Aamand, J Chen, P Indyk
Advances in Neural Information Processing Systems 35, 5724-5737, 2022
2022
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing
A Aamand, D Das, E Kipouridis, JBT Knudsen, PMR Rasmussen, ...
Proceedings of the VLDB Endowment 15 (13), 3989-4001, 2022
2022
Simple Hashing-Based Algorithms with Strong Theoretical Guarantees
A Aamand
School of The Faculty of Science, University of Copenhagen, 2020
2020
The system can't perform the operation now. Try again later.
Articles 1–18