Anders Aamand

Orcid: 0000-0002-0402-0514

According to our database1, Anders Aamand authored at least 20 papers between 2018 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Differentially Private Gomory-Hu Trees.
CoRR, 2024

2023
Tiling with Squares and Packing Dominos in Polynomial Time.
ACM Trans. Algorithms, July, 2023

Improved Space Bounds for Learning with Experts.
CoRR, 2023

Online Sorting and Translational Packing of Convex Polygons.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Improved Frequency Estimation Algorithms with and without Predictions.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Constant Approximation for Individual Preference Stable Clustering.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Data Structures for Density Estimation.
Proceedings of the International Conference on Machine Learning, 2023

Optimal Decremental Connectivity in Non-Sparse Graphs.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

2022
No Repetition: Fast and Reliable Sampling with Highly Concentrated Hashing.
Proc. VLDB Endow., 2022

Exponentially Improving the Complexity of Simulating the Weisfeiler-Lehman Test with Graph Neural Networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

(Optimal) Online Bipartite Matching with Degree Information.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Load balancing with dynamic set of balls and bins.
Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

Classifying Convex Bodies by Their Contact and Intersection Graphs.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Disks in Curves of Bounded Convex Curvature.
Am. Math. Mon., 2020

No Repetition: Fast Streaming with Highly Concentrated Hashing.
CoRR, 2020

Fast hashing with strong concentration bounds.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2019
(Learned) Frequency Estimation Algorithms under Zipfian Distribution.
CoRR, 2019

Non-empty Bins with Simple Tabulation Hashing.
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

2018
Power of d Choices with Simple Tabulation.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

One-Way Trail Orientations.
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018


  Loading...