Browse by People


Up a level
Export as [feed] RSS [feed] RSS 2.0 Short Author List
Number of items: 23.


Martínez, Conrado, Nebel, Markus E and Wild, Sebastian ORCID: 0000-0002-6061-9177
Analysis of Branch Misses in Quicksort. .


Nebel, Markus E, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Martinez, Conrado
(2016) Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica: an international journal in computer science, 75 (4). 632 - 683.


Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus E and Mahmoud, Hosam
(2016) Analysis of Quickselect Under Yaroslavskiy’s Dual-Pivoting Algorithm. Algorithmica: an international journal in computer science, 74 (1). 485 - 506.


Wild, Sebastian ORCID: 0000-0002-6061-9177 and Nebel, Markus E
(2012) Average Case Analysis of Java 7's Dual Pivot Quicksort. .


Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus E and Neininger, Ralph
(2015) Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Transactions on Algorithms, 11 (3).


Wild, Sebastian ORCID: 0000-0002-6061-9177
Average Cost of QuickXsort with Pivot Sampling. .


Reitzig, Raphael and Wild, Sebastian ORCID: 0000-0002-6061-9177
(2018) Building Fences Straight and High: An Optimal Algorithm for Finding the Maximum Length You Can Cut k Times from Given Sticks. Algorithmica: an international journal in computer science, 80 (11). 3365 - 3396.


Meng, He, Munro, J Ian, Nekrich, Yakov, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Wu, Kaiyu
(2020) Distance Oracles for Interval Graphs via Breadth-First Rank/Select in Succinct Trees. In: The 31st International Symposium on Algorithms and Computation (ISAAC'20), 2020-12-14 - 2020-09-18.


Wild, Sebastian ORCID: 0000-0002-6061-9177
(2018) Dual-pivot and beyond: The potential of multiway partitioning in quicksort. it - Information Technology, 60 (3). 173 - 177.


Durfee, David, Gao, Yu, Rao, Anup B and Wild, Sebastian ORCID: 0000-0002-6061-9177
Efficient Second-Order Shape-Constrained Function Fitting. .


Wild, Sebastian ORCID: 0000-0002-6061-9177, Nebel, Markus, Reitzig, Raphael and Laube, Ulrich
(2013) Engineering Java 7's Dual Pivot Quicksort Using MaLiJAn. .


Munro, J Ian and Wild, Sebastian ORCID: 0000-0002-6061-9177
Entropy Trees and Range-Minimum Queries In Optimal Average-Case Space. [Report]


Nebel, Markus E, Wild, Sebastian ORCID: 0000-0002-6061-9177, Holzhauser, Michael, Huettenberger, Lars, Reitzig, Raphael, Sperber, Matthias and Stoeck, Thorsten
(2011) JAGUC - A SOFTWARE PACKAGE FOR ENVIRONMENTAL DIVERSITY ANALYSES. JOURNAL OF BIOINFORMATICS AND COMPUTATIONAL BIOLOGY, 9 (6). 749 - 773.


Sandlund, Bryce and Wild, Sebastian ORCID: 0000-0002-6061-9177
(2020) Lazy Search Trees. .


Nebel, Markus E, Neumann, Elisabeth and Wild, Sebastian ORCID: 0000-0002-6061-9177
Median-of-k Jumplists and Dangling-Min BSTs. .


Munro, J Ian and Wild, Sebastian ORCID: 0000-0002-6061-9177
Nearly-Optimal Mergesorts: Fast, Practical Sorting Methods That Optimally Adapt to Existing Runs. .


Nebel, Markus E and Wild, Sebastian ORCID: 0000-0002-6061-9177
Pivot Sampling in Dual-Pivot Quicksort. .


Reitzig, Raphael and Wild, Sebastian ORCID: 0000-0002-6061-9177
A Practical and Worst-Case Efficient Algorithm for Divisor Methods of Apportionment. [Report]


Edelkamp, Stefan, Weiss, Armin and Wild, Sebastian ORCID: 0000-0002-6061-9177
(2020) QuickXsort: A Fast Sorting Scheme in Theory and Practice. [Report]


Wild, Sebastian ORCID: 0000-0002-6061-9177
Quicksort Is Optimal For Many Equal Keys. .


Martínez, Conrado, Nebel, Markus and Wild, Sebastian ORCID: 0000-0002-6061-9177
Sesquickselect: One and a half pivots for cache-efficient selection. .


Tsakalidis, Konstantinos ORCID: 0000-0001-6470-9332, Wild, Sebastian ORCID: 0000-0002-6061-9177 and Zamaraev, Viktor ORCID: 0000-0001-5755-4141
Succinct Permutation Graphs. [Report]


Wild, Sebastian ORCID: 0000-0002-6061-9177
Why Is Dual-Pivot Quicksort Fast? .

This list was generated on Thu Nov 19 04:13:34 2020 GMT.