Sebastian Wild
Cited by
Cited by
JAguc—a software package for environmental diversity analyses
ME Nebel, S Wild, M Holzhauser, L Hüttenberger, R Reitzig, M Sperber, ...
Journal of bioinformatics and computational biology 9 (06), 749-773, 2011
Average Case Analysis of Java 7’s Dual Pivot Quicksort
S Wild, M Nebel
Algorithms–ESA 2012, 825-836, 2012
Average case and distributional analysis of dual-pivot quicksort
S Wild, ME Nebel, R Neininger
ACM Transactions on Algorithms (TALG) 11 (3), 1-42, 2015
Java 7's Dual Pivot Quicksort
S Wild
University of Kaiserslautern, 2012
Analysis of quickselect under Yaroslavskiy’s dual-pivoting algorithm
S Wild, ME Nebel, H Mahmoud
Algorithmica 74 (1), 485-506, 2016
Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy’s partitioning scheme
ME Nebel, S Wild, C Martínez
Algorithmica 75 (4), 632-683, 2016
Dual-pivot quicksort and beyond: Analysis of multiway partitioning and its practical potential
S Wild
Technische Universität Kaiserslautern, 2016
Analysis of branch misses in quicksort
C Martínez, ME Nebel, S Wild
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and …, 2014
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan
S Wild, M Nebel, R Reitzig, U Laube
SIAM Meeting on Algorithm Engineering & Experiments 2013 (ALENEX13), 15, 2012
Entwurf und Analyse von Algorithmen: Eine Einführung in die Algorithmik mit Java
M Nebel, S Wild
Springer-Verlag, 2018
QuickXsort: A Fast Sorting Scheme in Theory and Practice
S Edelkamp, A Weiß, S Wild
Algorithmica 82 (3), 509-588, 2020
Quicksort Is Optimal For Many Equal Keys
S Wild
2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018
Pivot Sampling in Dual-Pivot Quicksort: Exploiting Asymmetries in Yaroslavskiy’s Partitioning Scheme
ME Nebel, S Wild
Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of …, 2014
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs
JI Munro, S Wild
26th Annual European Symposium on Algorithms (ESA 2018) 112, 2018
An Earley-style Parser for Solving the RNA-RNA Interaction Problem
S Wild
Bachelor thesis, TU Kaiserslautern, 2010
Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks
R Reitzig, S Wild
Algorithmica 80 (11), 3365-3396, 2018
A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment
R Reitzig, S Wild
arXiv preprint arXiv:1504.06475, 2015
Lazy search trees
B Sandlund, S Wild
2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space
JI Munro, S Wild
arXiv preprint arXiv:1903.02533, 2019
Average cost of QuickXsort with pivot sampling
S Wild
29th International Conference on Probabilistic, Combinatorial and Asymptotic …, 2018
The system can't perform the operation now. Try again later.
Articles 1–20