Follow
Martin Aumüller
Title
Cited by
Cited by
Year
ANN-Benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M Aumüller, E Bernhardsson, A Faithfull
Information Systems 87, 101374, 2020
2222020
Ann-benchmarks: A benchmarking tool for approximate nearest neighbor algorithms
M Aumüller, E Bernhardsson, A Faithfull
International conference on similarity search and applications, 34-49, 2017
1312017
Parameter-free locality sensitive hashing for spherical range reporting
TD Ahle, M Aumüller, R Pagh
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete …, 2017
462017
Optimal partitioning for dual-pivot quicksort
M Aumüller, M Dietzfelbinger
ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015
462015
Explicit and efficient hash families suffice for cuckoo hashing with a stash
M Aumüller, M Dietzfelbinger, P Woelfel
Algorithmica 70 (3), 428-456, 2014
462014
Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search
H Vardhan Simhadri, G Williams, M Aumüller, M Douze, A Babenko, ...
arXiv e-prints, arXiv: 2205.03763, 2022
39*2022
Distance-sensitive hashing
M Aumüller, T Christiani, R Pagh, F Silvestri
Proceedings of the 37th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2018
312018
PUFFINN: parameterless and universally fast finding of nearest neighbors
M Aumüller, T Christiani, R Pagh, M Vesterli
arXiv preprint arXiv:1906.12211, 2019
282019
The role of local dimensionality measures in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
Information Systems 101, 101807, 2021
26*2021
How good is multi-pivot quicksort?
M Aumüller, M Dietzfelbinger, P Klaue
ACM Transactions on Algorithms (TALG) 13 (1), 1-47, 2016
252016
Sampling a Near Neighbor in High Dimensions--Who is the Fairest of Them All?
M Aumüller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
arXiv preprint arXiv:2101.10905, 2021
20*2021
Fair near neighbor search via sampling
M Aumuller, S Har-Peled, S Mahabadi, R Pagh, F Silvestri
ACM SIGMOD Record 50 (1), 42-49, 2021
172021
Experimental variations of a theoretically good retrieval data structure
M Aumüller, M Dietzfelbinger, M Rink
Algorithms-ESA 2009: 17th Annual European Symposium, Copenhagen, Denmark …, 2009
152009
Overview of the SISAP 2023 Indexing Challenge
ES Tellez, M Aumüller, E Chavez
International Conference on Similarity Search and Applications, 255-264, 2023
92023
Representing sparse vectors with differential privacy, low error, optimal space, and fast access
M Aumüller, CJ Lebeda, R Pagh
Journal of Privacy and Confidentiality 12 (2), 2022
9*2022
Dual-pivot quicksort: Optimality, analysis and zeros of associated lattice paths
M Aumüller, M Dietzfelbinger, C Heuberger, D Krenn, H Prodinger
Combinatorics, Probability and Computing 28 (4), 485-518, 2019
9*2019
Benchmarking nearest neighbors
E Bernhardsson, M Aumüller, A Faithfull
92016
Differentially private sketches for Jaccard similarity estimation
M Aumüller, A Bourgeat, J Schmurr
Similarity Search and Applications: 13th International Conference, SISAP …, 2020
82020
A simple hash class with strong randomness properties in graphs and hypergraphs
M Aumüller, M Dietzfelbinger, P Woelfel
arXiv preprint arXiv:1611.00029, 2016
62016
An alternative analysis of cuckoo hashing with a stash and realistic hash functions
M Aumüller
Technische Universität Ilmenau, 2010
62010
The system can't perform the operation now. Try again later.
Articles 1–20