Martin Aumüller
Martin Aumüller
Assistant Professor, IT University of Copenhagen
Verified email at itu.dk - Homepage
Title
Cited by
Cited by
Year
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
722017
Optimal partitioning for dual-pivot quicksort
M Aumüller, M Dietzfelbinger
ACM Transactions on Algorithms (TALG) 12 (2), 1-36, 2015
402015
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
302014
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
272017
How good is multi-pivot quicksort?
M Aumüller, M Dietzfelbinger, P Klaue
ACM Transactions on Algorithms (TALG) 13 (1), 1-47, 2016
172016
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
132018
Experimental variations of a theoretically good retrieval data structure
M Aumüller, M Dietzfelbinger, M Rink
European Symposium on Algorithms, 742-751, 2009
92009
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
8*2019
PUFFINN: parameterless and universally fast finding of nearest neighbors
M Aumüller, T Christiani, R Pagh, M Vesterli
arXiv preprint arXiv:1906.12211, 2019
72019
The role of local intrinsic dimensionality in benchmarking nearest neighbor search
M Aumüller, M Ceccarello
International Conference on Similarity Search and Applications, 113-127, 2019
5*2019
An alternative analysis of cuckoo hashing with a stash and realistic hash functions
M Aumüller
Technische Universität Ilmenau, 2010
42010
Fair Near Neighbor Search: Independent Range Sampling in High Dimensions
M Aumüller, R Pagh, F Silvestri
Proceedings of the 39th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of …, 2020
22020
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
22016
On the Analysis of Two Fundamental Randomized Algorithms-Multi-Pivot Quicksort and Efficient Hash Functions
M Aumüller
22015
On the Analysis of Two Fundamental Randomized Algorithms
M Aumüller
Doktorarbeit (Ph. D, 2015
12015
Differentially Private Sketches for Jaccard Similarity Estimation
M Aumüller, A Bourgeat, J Schmurr
arXiv preprint arXiv:2008.08134, 2020
2020
Algorithm Engineering for High-Dimensional Similarity Search Problems (Invited Talk)
M Aumüller
18th International Symposium on Experimental Algorithms (SEA 2020), 2020
2020
Simple and Fast BlockQuicksort using Lomuto's Partitioning Scheme
M Aumüller, N Hass
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and …, 2019
2019
Dagstuhl Reports, Vol. 7, Issue 5 ISSN 2192-5283
M Dietzfelbinger, M Mitzenmacher, R Pagh, DP Woodruff, M Aumüller, ...
2018
Theory and Applications of Hashing (Dagstuhl Seminar 17181)
M Dietzfelbinger, M Mitzenmacher, R Pagh, DP Woodruff, M Aumüller
Dagstuhl Reports 7 (5), 2017
2017
The system can't perform the operation now. Try again later.
Articles 1–20