Scholar
Anders Aamand
Google Scholar ID: WpIvLroAAAAJ
University of Copenhagen
Citations & Impact
Citations
176
H-index
8
i10-index
6
Publications
20
Co-authors
31
list available
Contact
Publications
Resume (English only)
Academic Achievements
- Published several papers including 'Differentially Private Gomory-Hu Trees', 'Near-Optimal Trace Reconstruction for Mildly Separated Strings', 'Hashing for Sampling-Based Estimation', and more, covering areas such as machine learning, learning-augmented algorithms, and hashing-based algorithms and data structures.
Research Experience
- Currently a postdoctoral researcher at the University of Copenhagen at BARC (Basic Algorithms Research Copenhagen). Previously a postdoc at MIT, working with Piotr Indyk and his students.
Education
- Ph.D. from the University of Copenhagen, supervised by Mikkel Abrahamsen and Mikkel Thorup.
Background
- Broadly interested in theoretical computer science, particularly in differential privacy, learning-augmented algorithms, distribution testing, and hashing. Also enjoys working on various problems within graph theory and computational geometry.
Miscellany
- Email: andersaamanda@gmail.com
