Counting zeros in random walks on the integers and analysis of optimal dual-pivot quicksort

This article was published on 08. July 2016, Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, 2016.
(history: submitted on 12. February 2016, accepted on 22. April 2016, published on 08. July 2016)
Resources:
- http://arxiv.org/abs/1602.04031
Downloads:
- quicksort-paths.ipynb
Permalink: http://www.danielkrenn.at/quicksort-paths/
categories: math, article, accepted

Daniel Krenn's space