Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

12

CORR
2000
Springer

favoriteEmaildiscussreport

100views Education» more CORR 2000»

Perfect simulation from the Quicksort limit distribution

13 years 4 months ago

Perfect simulation from the Quicksort limit distribution

Download www.math.washington.edu

The weak limit of the normalized number of comparisons needed by the Quicksort algorithm to sort n randomly permuted items is known to be determined implicitly by a distributional fixed-point equation. We give an algorithm for perfect random variate generation from this distribution.

Luc Devroye, James Allen Fill, Ralph Neininger

Real-time Traffic

CORR 2000 | Distributional Fixed-point Equation | Education | Quicksort Algorithm | Weak Limit |

claim paper

Related Content

» Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions

» Super Scalar Sample Sort

» Distributional convergence for the number of symbol comparisons used by QuickSort

» A design framework for limited feedback MIMO systems with zeroforcing DFE

» Profiles of Random Trees Limit Theorems for Random Recursive Trees and Binary Search Trees

» Spatial Interference Cancelation for Mobile Ad Hoc Networks Perfect CSI

» Coupling from the Past in Hybrid Models for File Sharing Peer to Peer Systems

» Perfect Simulations for Random Trip Mobility Models

» Perfect simulation and stationarity of a class of mobility models

Post Info
More Details (n/a)

Added	17 Dec 2010
Updated	17 Dec 2010
Type	Journal
Year	2000
Where	CORR
Authors	Luc Devroye, James Allen Fill, Ralph Neininger

Comments (0)