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
22 2022 (Learned) Frequency Estimation Algorithms under Zipfian Distribution A Aamand, P Indyk, A Vakilian
arXiv preprint arXiv:1908.05198, 2019
17 2019 (Optimal) Online Bipartite Matching with Degree Information A Aamand, J Chen, P Indyk
Advances in Neural Information Processing Systems 35, 5724-5737, 2022
11 * 2022 Improved frequency estimation algorithms with and without predictions A Aamand, J Chen, H Nguyen, S Silwal, A Vakilian
Advances in Neural Information Processing Systems 36, 2024
10 2024 Optimal decremental connectivity in non-sparse graphs A Aaman, A Karczmarz, J Łącki, N Parotsidis, PMR Rasmussen, M Thorup
arXiv preprint arXiv:2111.09376, 2021
9 2021 Power of Choices with Simple Tabulation A Aamand, MBT Knudsen, M Thorup
arXiv preprint arXiv:1804.09684, 2018
9 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
8 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
8 2020 Improved space bounds for learning with experts A Aamand, JY Chen, HL Nguyen, S Silwal
arXiv preprint arXiv:2303.01453, 2023
7 2023 Non-empty bins with simple tabulation hashing A Aamand, M Thorup
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete …, 2019
5 2019 Data structures for density estimation A Aamand, A Andoni, JY Chen, P Indyk, S Narayanan, S Silwal
International Conference on Machine Learning, 1-18, 2023
4 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
4 2023 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 One-way trail orientations A Aamand, N Hjuler, J Holm, E Rotenberg
arXiv preprint arXiv:1708.07389, 2017
4 2017 Constant approximation for individual preference stable clustering A Aamand, J Chen, A Liu, S Silwal, P Sukprasert, A Vakilian, F Zhang
Advances in Neural Information Processing Systems 36, 2024
3 2024 Tiling with squares and packing dominos in polynomial time A Aamand, M Abrahamsen, TD Ahle, PMR Rasmussen
ACM Transactions on Algorithms 19 (3), 1-28, 2023
3 2023 50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) AR Karlin, R Kyng, P Baumann, M Ganardi, R Majumdar, RS Thinniyam, ...
Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2023
3 2023 Disks in curves of bounded convex curvature A Aamand, M Abrahamsen, M Thorup
The American Mathematical Monthly 127 (7), 579-593, 2020
3 2020 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
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