Sebastian Wild

Cited by

	All	Since 2019
Citations	365	155
h-index	12	8
i10-index	14	6

2010201120122013201420152016201720182019202020212022202320241 2 7 18 28 48 47 25 29 32 27 23 20 32 21

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
Matthias SperberAppleVerified email at apple.com
Thorsten StoeckProfessor der Biologie, Technische Universität KaiserslauternVerified email at rhrk.uni-kl.de
Viktor ZamaraevUniversity of LiverpoolVerified email at liverpool.ac.uk
Yakov NekrichAssociate Professor, Michigan Technological UniveristyVerified email at uwaterloo.ca
Meng HeAssociate Professor, Faculty of Computer Science, Dalhousie UniversityVerified email at cs.dal.ca
Nathaniel HarmsEPFLVerified email at epfl.ch
Edelkamp, StefanDepartment of Theor. Computer Science at Charles University and at FEL/CVUT in PragueVerified email at fel.cvut.cz
Armin WeißUniversität Stuttgart, FMIVerified email at fmi.uni-stuttgart.de
Leszek A GąsieniecUniversity of LiverpoolVerified email at liverpool.ac.uk
Patrick NicholsonShutterstockVerified email at uwaterloo.ca
Prudence W.H. WongDepartment of Computer Science, University of LiverpoolVerified email at liverpool.ac.uk
Travis GagieAssociate Professor at Dalhousie UniversityVerified email at dal.ca
Gerth Stølting BrodalAarhus UniversityVerified email at cs.au.dk
László KozmaFreie Universität Berlin, Department of Mathematics and Computer ScienceVerified email at cs.uni-saarland.de
Riko JacobITU CopenhagenVerified email at itu.dk
Ben SmithPhD student, Liverpool UniversityVerified email at liverpool.ac.uk

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	45	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	30	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	19	2016
Dual-pivot quicksort and beyond: Analysis of multiway partitioning and its practical potential S Wild Technische Universität Kaiserslautern, 2016	18	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	17	2022
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
QuickXsort: A Fast Sorting Scheme in Theory and Practice S Edelkamp, A Weiß, S Wild Algorithmica 82 (3), 509-588, 2020	13	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	13	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	11	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	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	5	2022
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	4	2021

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