Pages that link to "Item:Q1907894"
From MaRDI portal
The following pages link to Some properties of a limiting distribution in Quicksort (Q1907894):
Displaying 17 items.
- Running time of the treapsort algorithm (Q387004) (← links)
- The total path length of split trees (Q691101) (← links)
- On the tails of the limiting Quicksort distribution (Q894509) (← links)
- A characterization of the set of fixed points of the quicksort transformation (Q1572749) (← links)
- Perfect simulation from the quicksort limit distribution (Q1572752) (← links)
- On binary search tree recursions with monomials as toll functions (Q1612304) (← links)
- Limit laws for partial match queries in quadtrees (Q1872463) (← links)
- Average-case analysis of multiple Quickselect: An algorithm for finding order statistics (Q1922133) (← links)
- The quicksort process (Q2434753) (← links)
- On statistical tests of phylogenetic tree imbalance: The Sackin and other indices revisited (Q2486556) (← links)
- Approximating the limiting quicksort distribution (Q2772925) (← links)
- On a multivariate contraction method for random recursive structures with applications to quicksort (Q2772929) (← links)
- The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract). (Q2920867) (← links)
- A limiting distribution for quicksort (Q3833634) (← links)
- Asymptotic distributions for partial match queries in \(K\)-\(d\) trees (Q4521555) (← links)
- A note concerning the limit distribution of the quicksort algorithm (Q4717040) (← links)
- A limit theorem for “quicksort” (Q5750394) (← links)
