scientific article
From MaRDI portal
Publication:3836519
zbMath0947.68042MaRDI QIDQ3836519
Wojciech Szpankowski, Charles Knessl
Publication date: 9 December 1999
Full work available at URL: https://eudml.org/doc/120586
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (11)
On Tail Bounds for Random Recursive Trees ⋮ Unnamed Item ⋮ Distributional convergence for the number of symbol comparisons used by QuickSort ⋮ Asymptotic analysis of a family of polynomials associated with the inverse error function ⋮ Analysis of the expected number of bit comparisons required by quickselect ⋮ On densities for solutions to stochastic fixed point equations ⋮ On the tails of the limiting QuickSort density ⋮ Precise logarithmic asymptotics for the right tails of some limit random variables for random trees ⋮ Using nonlinear difference equations to study Quicksort algorithms ⋮ QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations ⋮ The height of a binary search tree: the limiting distribution perspective.
This page was built for publication:
