The following pages link to (Q4519900):
Displaying 30 items.
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- The middle pivot element algorithm (Q355523) (← links)
- Running time of the treapsort algorithm (Q387004) (← links)
- The oscillatory distribution of distances in random tries (Q558689) (← links)
- Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees (Q707496) (← links)
- Asymptotic distribution of two-protected nodes in random binary search trees (Q714563) (← links)
- Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
- Approximating the distribution function of risk (Q957280) (← links)
- Distributional analysis of swaps in quick select (Q964394) (← links)
- Limit laws for the Randić index of random binary tree models (Q1019451) (← links)
- Imbalance in random digital trees (Q1023981) (← links)
- Analysis of multiple quickselect variants. (Q1401319) (← links)
- A general limit theorem for recursive algorithms and combinatorial structures (Q1431560) (← links)
- On the variety of shapes in digital trees (Q1692230) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- Mixed Poisson approximation of node depth distributions in random binary search trees (Q1774220) (← links)
- QuickXsort: a fast sorting scheme in theory and practice (Q2292860) (← links)
- Replacement sort revisited: The ``gold standard'' unearthed! (Q2381333) (← links)
- How robust are average complexity measures? A statistical case study (Q2383700) (← links)
- Software complexity: a statistical case study through insertion sort (Q2383731) (← links)
- Random binary trees: from the average case analysis to the asymptotics of distributions (Q2457886) (← links)
- On edge-weighted recursive trees and inversions in random permutations (Q2467733) (← links)
- D?E?K=(1000)8 (Q2772918) (← links)
- On a multivariate contraction method for random recursive structures with applications to Quicksort (Q2772929) (← links)
- Analysis of swaps in radix selection (Q3021249) (← links)
- Asymptotic analysis of (3, 2, 1)-shell sort (Q3150199) (← links)
- Rapid Multipole Graph Drawing on the GPU (Q3611842) (← links)
- DEGREE PROFILE OF <i>m</i>-ARY SEARCH TREES: A VEHICLE FOR DATA STRUCTURE COMPRESSION (Q5358070) (← links)
- Distribution of the size of random hash trees, pebbled hash trees and \(N\)-trees (Q5952094) (← links)
- Statistical inference in massive data sets (Q6570844) (← links)
