Average Case Analysis of Java 7’s Dual Pivot Quicksort S Wild, M Nebel Algorithms–ESA 2012, 825-836, 2012 | 49 | 2012 |
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 | 47 | 2011 |
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 | 32 | 2015 |
Java 7's Dual Pivot Quicksort S Wild University of Kaiserslautern, 2012 | 25 | 2012 |
Analysis of quickselect under Yaroslavskiy’s dual-pivoting algorithm S Wild, ME Nebel, H Mahmoud Algorithmica 74, 485-506, 2016 | 22 | 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, 632-683, 2016 | 19 | 2016 |
Randomized communication and implicit graph representations N Harms, S Wild, V Zamaraev Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing …, 2022 | 18 | 2022 |
Dual-pivot quicksort and beyond: Analysis of multiway partitioning and its practical potential S Wild Technische Universität Kaiserslautern, 2016 | 18 | 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 | 16 | 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 | 16* | 2012 |
Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees M He, JI Munro, Y Nekrich, S Wild, K Wu 31st International Symposium on Algorithms and Computation (ISAAC 2020), 2020 | 15 | 2020 |
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 | 15 | 2018 |
QuickXsort: A Fast Sorting Scheme in Theory and Practice S Edelkamp, A Weiß, S Wild Algorithmica 82 (3), 509-588, 2020 | 13 | 2020 |
Quicksort Is Optimal For Many Equal Keys S Wild 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018 | 11 | 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 | 9* | 2014 |
Average case and distributional analysis of Java 7’s dual pivot quicksort S Wild, ME Nebel, R Neininger arXiv preprint arXiv:1304.0988, 2013 | 8 | 2013 |
An Earley-style Parser for Solving the RNA-RNA Interaction Problem S Wild Bachelor thesis, TU Kaiserslautern, 2010 | 8* | 2010 |
Hypersuccinct Trees-New Universal Tree Source Codes for Optimal Compressed Tree Data Structures and Range Minima JI Munro, PK Nicholson, LS Benkner, S Wild 29th Annual European Symposium on Algorithms (ESA 2021), 2021 | 7 | 2021 |
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 | 6* | 2018 |
Succinct permutation graphs K Tsakalidis, S Wild, V Zamaraev Algorithmica, 1-35, 2022 | 5 | 2022 |