| (Learned) Frequency Estimation Algorithms under Zipfian Distribution A Aamand, P Indyk, A Vakilian arXiv preprint arXiv:1908.05198, 2019 | 10 | 2019 |
| Power of Choices with Simple Tabulation A Aamand, MBT Knudsen, M Thorup arXiv preprint arXiv:1804.09684, 2018 | 7 | 2018 |
| 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 | 4 | 2021 |
| Classifying convex bodies by their contact and intersection graphs A Aamand, M Abrahamsen, JBT Knudsen, PMR Rasmussen arXiv preprint arXiv:1902.01732, 2019 | 4 | 2019 |
| (Optimal) Online Bipartite Matching with Predicted Degrees A Aamand, JY Chen, P Indyk arXiv e-prints, arXiv: 2110.11439, 2021 | 3 | 2021 |
| 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 | 3 | 2020 |
| Disks in curves of bounded convex curvature A Aamand, M Abrahamsen, M Thorup The American Mathematical Monthly 127 (7), 579-593, 2020 | 2 | 2020 |
| Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks A Aamand, JY Chen, P Indyk, S Narayanan, R Rubinfeld, N Schiefer, ... arXiv preprint arXiv:2211.03232, 2022 | 1 | 2022 |
| On sums of monotone random integer variables A Aamand, N Alon, JBT Houen, M Thorup Electronic Communications in Probability 27, 1-8, 2022 | 1 | 2022 |
| Tiling with squares and packing dominos in polynomial time A Aamand, M Abrahamsen, TD Ahle, PMR Rasmussen arXiv preprint arXiv:2011.10983, 2020 | 1 | 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 | 1 | 2020 |
| Non-empty bins with simple tabulation hashing A Aamand, M Thorup Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019 | 1 | 2019 |
| One-Way Trail Orientations A Aamand, N Hjuler, J Holm, E Rotenberg arXiv preprint arXiv:1708.07389, 2017 | 1 | 2017 |
| 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 |
| 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 |
| (Optimal) Online Bipartite Matching with Degree Information A Aamand, JY Chen, P Indyk arXiv preprint arXiv:2110.11439, 2021 | | 2021 |
| Simple Hashing-Based Algorithms with Strong Theoretical Guarantees A Aamand School of The Faculty of Science, University of Copenhagen, 2020 | | 2020 |
Mikkel ThorupUniversity of CopenhagenVerified email at diku.dk
