The following pages link to Quicksort (Q32511):
Displaying 18 items.
- (Q5111230) (← links)
- In-Place Parallel Super Scalar Samplesort (IPSSSSo) (Q5111694) (← links)
- Algorithms from THE BOOK (Q5119684) (← links)
- Limit distribution of the quartet balance index for Aldous’s $(\beta \ge 0)$-model (Q5119790) (← links)
- Data Clustering: Theory, Algorithms, and Applications, Second Edition (Q5151805) (← links)
- All solutions of the stochastic fixed point equation of the Quicksort process (Q5215058) (← links)
- Dual-Pivot Quicksort: Optimality, Analysis and Zeros of Associated Lattice Paths (Q5219324) (← links)
- Inversions in Split Trees and Conditional Galton–Watson Trees (Q5222541) (← links)
- A note on the quicksort asymptotics (Q5265342) (← links)
- Limit distribution of the coefficients of polynomials with only unit roots (Q5265344) (← links)
- On Smoothed Analysis of Quicksort and Hoare’s Find (Q5323060) (← links)
- Local Intrinsic Dimension Estimation by Generalized Linear Modeling (Q5380819) (← links)
- On the total length of the random minimal directed spanning tree (Q5480003) (← links)
- Partial sorting: A large vector technique and its application (Q5679702) (← links)
- On martingale tail sums for the path length in random trees (Q5739101) (← links)
- Applying Sorting Networks to Synthesize Optimized Sorting Libraries (Q5743589) (← links)
- A limit theorem for “quicksort” (Q5750394) (← links)
- Verified analysis of random binary tree structures (Q5919010) (← links)
