Scholar
Martin Aumüller
Google Scholar ID: TNJYIYoAAAAJ
IT University of Copenhagen
Citations & Impact
Citations
1,060
H-index
15
i10-index
18
Publications
20
Co-authors
40
list available
Publications
Resume (English only)
Academic Achievements
- - Papers published: ann-benchmarks, big-ann-benchmarks, puffinn, danny
- - Organized challenges: SISAP Indexing Challenge (2025, 2024), NeurIPS Practical Vector Search challenge (2023), SISAP Indexing Challenge (2023), NeurIPS Billion-Scale ANN Challenge (2021)
- - Invited talks: Algorithm Engineering for High-Dimensional Similarity Search at SEA’20
- - Tutorials: Neural Search in Action at CVPR’23
- - Program committee member: SEA 2018, ESA 2018 (Track B), MMM 2019, EDML 2019, MM 2019 Reproducibility, SISAP 2019, SISAP 2020 (co-chair), ICMR 2021/2022/2023 Reproducibility (co-chair), LATIN 2022, SISAP 2024, CIKM 2024, ESA 2025 (Track S), ICML’25 VecDB Workshop (co-chair)
Research Experience
- - Projects: Benefit and Bias of Approximate Nearest Neighbor search (2022-2025, PI)
- - Projects: MMX-VR: Multimedia Metadata Exploration in Virtual Reality (2023-2026, co-PI)
- - PhD students: Camilla Birch Okkels, Fabrizio Boninsegna (co-supervised with Francesco Silvestri)
- - Finished PhD students: Christian Janos Lebeda (co-supervised with Rasmus Pagh, now postdoc at INRIA, France)
- - Teaching experience: Taught multiple courses at IT University of Copenhagen, including Algorithmic Problem Solving, Applied Algorithms, etc.
Education
- - PhD: 2015, Technische Universität Ilmenau, supervised by Martin Dietzfelbinger
Background
- - Research interests: Design, analysis, and implementation of randomized algorithms, particularly for similarity search and differential privacy
- - Position: Associate Professor in the Algorithms Group at IT University of Copenhagen, Head of MSc in Software Design
Miscellany
- - Code available on GitHub
- - Ancient but potentially useful algorithm visualizations: Auction Matching, Cuckoo Hashing
