Pages that link to "Item:Q3833634"

The following pages link to A limiting distribution for quicksort (Q3833634):

Displaying 43 items.

• Running time of the treapsort algorithm (Q387004) (← links)
• General combinatorial schemas: Gaussian limit distributions and exponential tails (Q685672) (← links)
• The total path length of split trees (Q691101) (← links)
• Distribution of a class of divide and conquer recurrences arising from the computation of the Walsh-Hadamard transform (Q818111) (← links)
• On the silhouette of binary search trees (Q983879) (← links)
• Automatic average-case analysis of algorithms (Q1174718) (← links)
• Distances in random plane-oriented recursive trees (Q1195423) (← links)
• General Edgeworth expansions with applications to profiles of random trees (Q1704141) (← links)
• Exact and approximate limit behaviour of the Yule tree's cophenetic index (Q1711952) (← links)
• On the tails of the limiting QuickSort density (Q1725502) (← links)
• On weighted depths in random binary search trees (Q1800490) (← links)
• Some properties of a limiting distribution in Quicksort (Q1907894) (← links)
• Average-case analysis of multiple Quickselect: An algorithm for finding order statistics (Q1922133) (← links)
• Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
• Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
• Cost functionals for large (uniform and simply generated) random trees (Q1990219) (← links)
• Almost sure convergence to the quicksort process (Q2196368) (← links)
• QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations (Q2316591) (← links)
• Analyzing randomized search heuristics via stochastic domination (Q2415323) (← links)
• The quicksort process (Q2434753) (← links)
• Search trees: metric aspects and strong limit theorems (Q2454410) (← links)
• Random binary trees: from the average case analysis to the asymptotics of distributions (Q2457886) (← links)
• Logarithmic integrals, zeta values, and tiered binomial coefficients (Q2664019) (← links)
• On the number of iterations required by Von Neumann addition (Q2771496) (← links)
• Approximating the limiting Quicksort distribution (Q2772925) (← links)
• On a multivariate contraction method for random recursive structures with applications to Quicksort (Q2772929) (← links)
• Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect (Q2837754) (← links)
• The Weighted Branching Process (Q3179788) (← links)
• Combinatorial analysis of quicksort algorithm (Q4203824) (← links)
• On the internal path length ofd-dimensional quad trees (Q4262416) (← links)
• An almost sure result for path lengths in binary search trees (Q4449502) (← links)
• A note concerning the limit distribution of the quicksort algorithm (Q4717040) (← links)
• Analysis of quickselect : an algorithm for order statistics (Q4858843) (← links)
• (Q4993543) (← links)
• Stochastic fixed-point equations (Q5231283) (← links)
• A note on the quicksort asymptotics (Q5265342) (← links)
• On densities for solutions to stochastic fixed point equations (Q5381055) (← links)
• Minimal clade size and external branch length under the neutral coalescent (Q5697195) (← links)
• On martingale tail sums for the path length in random trees (Q5739101) (← links)
• A limit theorem for “quicksort” (Q5750394) (← links)
• Upper tail analysis of bucket sort and random tries (Q5925527) (← links)
• Upper tail analysis of bucket sort and random tries (Q5925674) (← links)
• Balancing \(m\)-ary search trees with compressions on the fringe (Q6150114) (← links)