| 2025 | EDBT | High-dimensional density-based clustering using locality-sensitive hashing. | Camilla Birch Okkels, Martin Aumller, Viktor Bello Thomsen, Arthur Zimek |
| 2025 | SISAP | Approximate Single-Linkage Clustering Using Graph-Based Indexes: MST-Based Approaches and Incremental Searchers. | Camilla Birch Okkels, Erik Thordsen, Martin Aumller, Arthur Zimek, Erich Schubert |
| 2025 | SISAP | Overview of the SISAP 2025 Indexing Challenge. | Eric Sadit Tellez, Edgar Chvez, Martin Aumller, Vladimir Mic |
| 2024 | SISAP | An Empirical Evaluation of Search Strategies for Locality-Sensitive Hashing: Lookup, Voting, and Natural Classifier Search. | Malte Helin Johnsen, Martin Aumller |
| 2024 | SISAP | On the Design of Scalable Outlier Detection Methods Using Approximate Nearest Neighbor Graphs. | Camilla Birch Okkels, Martin Aumller, Arthur Zimek |
| 2024 | SISAP | Overview of the SISAP 2024 Indexing Challenge. | Eric Sadit Tellez, Martin Aumller, Vladimir Mic |
| 2023 | SISAP | Solving k-Closest Pairs in High-Dimensional Data. | Martin Aumller, Matteo Ceccarello |
| 2023 | SISAP | Suitability of Nearest Neighbour Indexes for Multimedia Relevance Feedback. | Omar Shahbaz Khan, Martin Aumller, Bjrn r Jnsson |
| 2023 | SISAP | Overview of the SISAP 2023 Indexing Challenge. | Eric Sadit Tellez, Martin Aumller, Edgar Chvez |
| 2022 | AISTATS | DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search. | Matti Karppa, Martin Aumller, Rasmus Pagh |
| 2022 | EDBT | Implementing Distributed Similarity Joins using Locality Sensitive Hashing. | Martin Aumller, Matteo Ceccarello |
| 2021 | CCS | Differentially Private Sparse Vectors with Low Error, Optimal Space, and Fast Access. | Martin Aumller, Christian Janos Lebeda, Rasmus Pagh |
| 2020 | EGPGV | High-Quality Rendering of Glyphs Using Hardware-Accelerated Ray Tracing. | Stefan Zellmann, Martin Aumller, Nathan Marshak, Ingo Wald |
| 2020 | PODS | Fair Near Neighbor Search: Independent Range Sampling in High Dimensions. | Martin Aumller, Rasmus Pagh, Francesco Silvestri |
| 2020 | SISAP | Differentially Private Sketches for Jaccard Similarity Estimation. | Martin Aumller, Anders Bourgeat, Jana Schmurr |
| 2020 | SISAP | Running Experiments with Confidence and Sanity. | Martin Aumller, Matteo Ceccarello |
| 2019 | ALENEX | Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme. | Martin Aumller, Nikolaj Hass |
| 2019 | EGPGV | Hybrid Remote Visualization in Immersive Virtual Environments with Vistle. | Martin Aumller |
| 2019 | ESA | PUFFINN: Parameterless and Universally Fast FInding of Nearest Neighbors. | Martin Aumller, Tobias Christiani, Rasmus Pagh, Michael Vesterli |
| 2019 | SDM | Benchmarking Nearest Neighbor Search: Influence of Local Intrinsic Dimensionality and Result Diversity in Real-World Datasets. | Martin Aumller, Matteo Ceccarello |
| 2019 | SISAP | The Role of Local Intrinsic Dimensionality in Benchmarking Nearest Neighbor Search. | Martin Aumller, Matteo Ceccarello |
| 2018 | PODS | Distance-Sensitive Hashing. | Martin Aumller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri |
| 2017 | SODA | Parameter-free Locality Sensitive Hashing for Spherical Range Reporting. | Thomas D. Ahle, Martin Aumller, Rasmus Pagh |
| 2017 | SISAP | ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms. | Martin Aumller, Erik Bernhardsson, Alexander John Faithfull |
| 2013 | ICALP | Optimal Partitioning for Dual Pivot Quicksort - (Extended Abstract). | Martin Aumller, Martin Dietzfelbinger |
| 2012 | ESA | Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash. | Martin Aumller, Martin Dietzfelbinger, Philipp Woelfel |
| 2009 | ESA | Experimental Variations of a Theoretically Good Retrieval Data Structure. | Martin Aumller, Martin Dietzfelbinger, Michael Rink |