
Sebastian Wild CV · page 4 of 12
[c3] Pivot Sampling in Dual-Pivot Quicksort
Markus E. Nebel and Sebastian Wild
International Conference on Probabilistic, Combinatorial and
Asymptotic Methods for the Analysis of Algorithms (AofA) 2014
M. Bousquet-Mélou, M. Soria (eds.): DMTCS-HAL Proceedings Series, vol. BA, pp 325–338
[c2] Engineering Java 7’s Dual Pivot Quicksort Using MaLiJAn
Sebastian Wild, Markus E. Nebel, Raphael Reitzig, and Ulrich Laube
Meeting on Algorithm Engineering and Experiments (ALENEX) 2013
P. Sanders, N. Zeh (eds.): ALENEX 2013, SIAM, pp 55–69
[c1] Average Case Analysis of Java 7’s Dual Pivot Quicksort
Sebastian Wild and Markus E. Nebel
European Symposium on Algorithms (ESA) 2012
L. Epstein and P. Ferragina (eds.): ESA 2012, LNCS 7501, Springer, pp 825–836.
Peer-Reviewed Journal Articles
[j9] A Simple and Fast Linear-Time Algorithm for Divisor Methods of Apportionment
Raphael Reitzig and Sebastian Wild
Mathematical Programming B, 2023
[j8] Succinct Permutation Graphs
Konstantinos Tsakalidis, Sebastian Wild, and Viktor Zamaraev
Algorithmica 85, 2, pp 509–543, 2022
[j7] QuickXsort – A Fast Sorting Scheme in Theory and Practice
Stefan Edelkamp, Armin Weiß, and Sebastian Wild
Algorithmica 82, 3, pp 509–588, 2020
[j6] Dual-pivot and beyond: The potential of multiway partitioning in quicksort
Sebastian Wild
Distinguished Dissertations in it – Information Technology, 60, 3, pp 173–177, 2018
[j5] Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum
Length You Can Cut k Times from Given Sticks
Raphael Reitzig and Sebastian Wild
Algorithmica 80, 11, pp 3365–3396, 2018
[j4] Analysis of Pivot Sampling in Dual-Pivot Quicksort
Markus E. Nebel, Sebastian Wild, and Conrado Martínez
Algorithmica 75, 4, pp 632–683, 2016
[j3] Analysis of Quickselect under Yaroslavskiy’s Dual-Pivoting Algorithm
Sebastian Wild, Markus E. Nebel, and Hosam Mahmoud
Algorithmica 74, 1, pp 485–506, 2016
[j2] Average Case and Distributional Analysis of Dual Pivot Quicksort
Sebastian Wild, Markus E. Nebel, and Ralph Neininger
ACM Transactions on Algorithms 11, 3, article 22, 2015