Tomi T. Ahonen. Smartphone bloodbath market share update q1: All the top 10 brands plus os shares plus installed base. http://communities-dominate.blogs.com/brands/2016/05/smartphone-bloodbath-market-share-update-q1-all-the-top-10-brands-plus-os-shares-plus-installed-base.html, 2016.Google Scholar
Jon Bentley. Programming pearls: how to sort. Communications of the ACM, 27(4):287–291, April 1984.Google Scholar
Jon L. Bentley and M. Douglas McIlroy. Engineering a sort function. Software: Practice and Experience, 23(11):1249–1265, 1993.Google Scholar
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. Introduction to Algorithms. MIT Press, 3rd edition, 2009.Google Scholar
Pascal Hennequin. Analyse en moyenne d’algorithmes : tri rapide et arbres de recherche. Thèse (Ph. D. Thesis), Ecole Politechnique, Palaiseau, 1991.Google Scholar
Java Core Library Development Mailing List. Replacement of quicksort in java.util.arrays with new dual-pivot quicksort, 2009.
JDK Bug System. Replace modified mergesort in java.util.arrays.sort with timsort. https://bugs.openjdk.java.net/browse/JDK-6804124, 2009.Google Scholar
Shrinu Kushagra, Alejandro López-Ortiz, Aurick Qiao, and J. Ian Munro. Multi-pivot Quicksort: Theory and experiments. In Meeting on Algorithm Engineering and Experiments (ALENEX), pages 47–60. SIAM, 2014.Google Scholar
John D. McCalpin. Sustainable memory bandwidth in high performance computers. Technical report, University of Virginia, Charlottesville, Virginia, 1991–2007, continually updated technical report.Google Scholar
Robert Sedgewick. Quicksort. Reprint of the author’s Ph. D. thesis, Garland Publishing, 1980.Google Scholar
Sebastian Wild. Dual-Pivot Quicksort and Beyond: Analysis of Multiway Partitioning and Its Practical Potential. Doktorarbeit (Ph. D. thesis), Technische Universität Kaiserslautern, 2016. ISBN 978-3-00-054669-3.Google Scholar
Sebastian Wild and Markus E. Nebel. Average case analysis of Java 7’s dual pivot Quicksort. In Leah Epstein and Paolo Ferragina, editors, European Symposium on Algorithms (ESA), volume 7501 of LNCS, pages 825–836. Springer, 2012.Google Scholar
About the article
Dr. Sebastian Wild studied computer science at Technische Universität Kaiserslautern on a scholarship by Studienstiftung des deutschen Volkes and graduated in 2012 with a Master of Science. After that he did his Ph. D. as wissenschaftlicher Mitarbeiter (employed doctoral candidate with teaching duties) in the research group of Prof. Dr. Markus Nebel. His findings in the field of analysis of algorithms soon led to publications and international collaborations, including a Best Paper Award  at the European Symposium on Algorithms 2012. Sebastian was continually involved in teaching. During his studies he was a student tutor and during his Ph. D. years, he was responsible for organizing tutorials and involved in the development of new courses. Sebastian is married and father of three children.
Published Online: 2018-06-28
Published in Print: 2018-07-01