Submitted papers
Journal articles
- 2016: How Good is Multi-Pivot Quicksort?, Martin Aumüller, Martin Dietzfelbinger, Pascal Klaue.
ACM Transactions on Algorithms 13(1). Additional Material
- 2015: Optimal Partitioning for Dual-Pivot Quicksort,
Martin Aumüller, Martin Dietzfelbinger, ACM Transactions on Algorithms 12(2).
- 2014: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash, Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel, invited paper, Algorithmica 70(3). Additional Material
Conference papers
- 2018: Distance-sensitive Hashing, Martin Aumüller, Tobias Christiani, Rasmus Pagh, Francesco Silvestri. Accepted at PODS’18.
- 2017: ANN-Benchmarks: A Benchmarking Tool for Approximate Nearest Neighbor Algorithms, M. Aumüller, E. Bernhardsson, A. Faithfull. SISAP 2017.
- 2017: Parameter-free Locality Sensitive Hashing for Spherical Range Reporting, Thomas D. Ahle, Martin Aumüller, Rasmus Pagh. SODA 2017, slides
- 2016: Counting Zeros in Random Walks on the Integers and Analysis of Optimal Dual-Pivot Quicksort, Martin Aumüller, Martin Dietzfelbinger, Clemens Heuberger, Daniel Krenn, Helmut Prodinger. AofA 2016
- 2013: Optimal Partitioning for Dual Pivot Quicksort, Martin Aumüller, Martin Dietzfelbinger, ICALP 2013, slides.
- 2012: Explicit and Efficient Hash Families Suffice for Cuckoo Hashing with a Stash, Martin Aumüller, Martin Dietzfelbinger, Philipp Woelfel, ESA 2012, slides.
- 2009: Experimental variations of a theoretically good retrieval data structure, Martin Aumüller, Martin Dietzfelbinger, Michael Rink, ESA 2009.
PhD Thesis
Diploma Thesis