The following pages link to Sebastian Wild (Q261383):
Displayed 21 items.
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749) (← links)
- Efficient second-order shape-constrained function fitting (Q2285107) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Succinct permutation graphs (Q2684486) (← links)
- (Q2789570) (← links)
- Average Case Analysis of Java 7’s Dual Pivot Quicksort (Q2912899) (← links)
- Average Case and Distributional Analysis of Dual-Pivot Quicksort (Q4962180) (← links)
- (Q4993558) (← links)
- (Q5009630) (← links)
- Analysis of Branch Misses in Quicksort (Q5194799) (← links)
- Quicksort Is Optimal For Many Equal Keys (Q5195100) (← links)
- Sesquickselect: One and a half pivots for cache-efficient selection (Q5195231) (← links)
- Median-of-<i>k</i> Jumplists and Dangling-Min BSTs (Q5195235) (← links)
- (Q6065424) (← links)
- (Q6075965) (← links)
- Randomized communication and implicit graph representations (Q6083575) (← links)
- A simple and fast linear-time algorithm for divisor methods of apportionment (Q6120938) (← links)
- Pivot Sampling in Dual-Pivot Quicksort (Q6250154) (← links)
- Finding the saddlepoint faster than sorting (Q6456691) (← links)