Martin Aumüller

From MaRDI portal
(Redirected from Martin Aumüller)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
PUFFINN: parameterless and universally fast finding of nearest neighbors
(available as arXiv preprint)
2022-05-11Paper
Dual-pivot quicksort: optimality, analysis and zeros of associated lattice paths
Combinatorics, Probability and Computing
2020-03-11Paper
Simple and fast BlockQuicksort using Lomuto's partitioning scheme
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX)
2019-09-13Paper
Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort
(available as arXiv preprint)
2019-04-29Paper
How good is multi-pivot quicksort?
ACM Transactions on Algorithms
2018-11-05Paper
Optimal partitioning for dual-pivot quicksort
ACM Transactions on Algorithms
2018-10-30Paper
Parameter-free locality sensitive hashing for spherical range reporting
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Algorithmica
2015-01-19Paper
Optimal Partitioning for Dual Pivot Quicksort
Automata, Languages, and Programming
2013-08-06Paper
Explicit and efficient hash families suffice for cuckoo hashing with a stash
Lecture Notes in Computer Science
2012-09-25Paper


Research outcomes over time


This page was built for person: Martin Aumüller