Sebastian Wild

Cited by

	All	Since 2018
Citations	346	166
h-index	12	8
i10-index	13	8

201020112012201320142015201620172018201920202021202220231 2 7 18 28 48 47 25 32 31 27 22 21 30

Public access

View all

12 articles

0 articles

available

not available

Based on funding mandates

Co-authors

Raphael ReitzigVerified email at cs.uni-kl.de
Ian MunroUniversity Professor, University of WaterlooVerified email at uwaterloo.ca
Conrado MartinezProfessor of Computer Science, Univ. Politècnica CatalunyaVerified email at cs.upc.edu
Ralph NeiningerGoethe Universität, Frankfurt a.M.Verified email at math.uni-frankfurt.de
Viktor ZamaraevUniversity of LiverpoolVerified email at liverpool.ac.uk
Matthias SperberAppleVerified email at apple.com
Thorsten StoeckProfessor der Biologie, Technische Universität KaiserslauternVerified email at rhrk.uni-kl.de
Nathaniel HarmsEPFLVerified email at uwaterloo.ca
Yakov NekrichAssociate Professor, Michigan Technological UniveristyVerified email at uwaterloo.ca
Meng HeAssociate Professor, Faculty of Computer Science, Dalhousie UniversityVerified email at cs.dal.ca
Edelkamp, StefanComputer Science & Artificial Intelligence Center Faculty of Electrical Engineering, CTU in PragueVerified email at fel.cvut.cz
Armin WeißUniversität Stuttgart, FMIVerified email at fmi.uni-stuttgart.de
Patrick NicholsonShutterstockVerified email at uwaterloo.ca
Travis GagieAssociate Professor at Dalhousie UniversityVerified email at dal.ca
Bryce SandlundOptimization at Gopuff, University of Waterloo PhDVerified email at gopuff.com
Leszek A GąsieniecUniversity of LiverpoolVerified email at liverpool.ac.uk
Anup B. RaoGeorgia Institute of TechnologyVerified email at gatech.edu
Richard PengUniversity of WaterlooVerified email at uwaterloo.ca
Konstantinos Tsakalidis Κωνσταντίνος...Department of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Yu GaoVerified email at gatech.edu

Sebastian Wild

University of Liverpool

Verified email at liverpool.ac.uk - Homepage

Algorithms Data Structures Analysis of Algorithms Algorithm Engineering Algorithm Science


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
Average Case Analysis of Java 7’s Dual Pivot Quicksort S Wild, M Nebel Algorithms–ESA 2012, 825-836, 2012	48	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	44	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	29	2015
Java 7's Dual Pivot Quicksort S Wild University of Kaiserslautern, 2012	24	2012
Analysis of quickselect under Yaroslavskiy’s dual-pivoting algorithm S Wild, ME Nebel, H Mahmoud Algorithmica 74, 485-506, 2016	21	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	20	2016
Dual-pivot quicksort and beyond: Analysis of multiway partitioning and its practical potential S Wild Technische Universität Kaiserslautern, 2016	19	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	15	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	15*	2012
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	13*	2022
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	13	2018
QuickXsort: A Fast Sorting Scheme in Theory and Practice S Edelkamp, A Weiß, S Wild Algorithmica 82 (3), 509-588, 2020	12	2020
Quicksort Is Optimal For Many Equal Keys S Wild 2018 Proceedings of the Fifteenth Workshop on Analytic Algorithmics and …, 2018	11	2018
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	8*	2020
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	8*	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
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
Towards the 5/6-Density Conjecture of Pinwheel Scheduling L Gąsieniec, B Smith, S Wild 2022 Proceedings of the Symposium on Algorithm Engineering and Experiments …, 2022	3	2022
Lazy search trees B Sandlund, S Wild 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS …, 2020	3	2020

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow

Cited by

Co-authors