- An Interruptible Algorithm for Perfect Sampling via Markov Chains
- Quicksort Asymptotics James Allen Fill1
- The space requirement of m-ary search trees: distributional asymptotics for m 27
- Fields Institute Communications Volume 00, 0000
- Combinatorial/probabilistic analysis of a class of search-tree functionals
- E l e c t r o n b a b i l i t y
- The Number of Symbol Comparisons in QuickSort and QuickSelect
- Analysis of the Expected Number of Bit Comparisons Required by Quickselect
- Analysis of the Expected Number of Bit Comparisons Required by Quickselect
- The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
- PRECISE LOGARITHMIC ASYMPTOTICS FOR THE RIGHT TAILS OF SOME LIMIT RANDOM VARIABLES
- E l e c t r o n i o b a b i l i t y
- Discrete Mathematics and Theoretical Computer Science (subm.), by the authors, 1rev EXTENDED ABSTRACT: A repertoire for
- A REPERTOIRE FOR ADDITIVE FUNCTIONALS OF UNIFORMLY DISTRIBUTED m-ARY SEARCH TREES
- DESTRUCTION OF VERY SIMPLE TREES JAMES ALLEN FILL, NEVIN KAPUR, AND ALOIS PANHOLZER
- EXACT EXPECTATIONS OF MINIMAL SPANNING TREES FOR GRAPHS WITH RANDOM EDGE WEIGHTS
- Asymptotic Analysis via Mellin Transforms for Small Deviations in L2
- Singularity Analysis, Hadamard Products,
- Speeding up the FMMR perfect sampling algorithm: A case study revisited
- Appendix to Quicksort Asymptotics James Allen Fill1
- The Randomness Recycler Approach to Perfect James Allen Fill
- MIXING TIMES FOR MARKOV CHAINS ON WREATH PRODUCTS AND RELATED HOMOGENEOUS SPACES
- A Characterization of the Set of Fixed Points of the Quicksort Transformation
- Smoothness and Decay Properties of the Limiting Quicksort Density Function
- The MoorePenrose Generalized Inverse for Sums of Matrices
- Interruptible Exact Sampling in the Passive Case Keith Crank 1
- On hitting times and fastest strong stationary times for skip-free and more general chains
- On Compositions of Random Functions on a Finite Set James Allen Fill 1
- Random intersection graphs when m = #(n): an equivalence theorem relating the evolution of the
- Combinatorial/probabilistic searchtree
- Transfer Theorems and Asymptotic Distributional Results for m-ary Search Trees
- LIMITING DISTRIBUTIONS FOR ADDITIVE FUNCTIONALS ON CATALAN TREES
- ON VERTEX, EDGE, AND VERTEX-EDGE RANDOM GRAPHS ELIZABETH BEER, JAMES ALLEN FILL, SVANTE JANSON,
- Extension of Fill's perfect rejection sampling algorithm to general chains
- Distributional Convergence for the Number of Symbol Comparisons Used by QuickSort
- The Randomness Recycler: A New Technique for Perfect Sampling James Allen Fill
- The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis
- ON VERTEX, EDGE, AND VERTEX-EDGE RANDOM GRAPHS (EXTENDED ABSTRACT)
- Perfect Simulation from the Quicksort Limit Distribution
- The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis
- HITTING TIMES AND INTERLACING EIGENVALUES: A STOCHASTIC APPROACH USING INTERTWININGS
- -DISTANCE FROM THE LIMIT FOR QUICKSORT KEY COMPARISONS (EXTENDED ABSTRACT)
- THE LIMITING DISTRIBUTION FOR THE NUMBER OF SYMBOL COMPARISONS USED BY QUICKSORT IS
- THE NUMBER OF BIT COMPARISONS USED BY QUICKSORT: AN AVERAGE-CASE ANALYSIS
- DISTRIBUTIONAL CONVERGENCE FOR THE NUMBER OF SYMBOL COMPARISONS USED BY QUICKSORT
- arXiv:submit/0326923[math.PR]28Sep2011 COMPARISON INEQUALITIES AND FASTEST-MIXING
- DISTRIBUTIONAL CONVERGENCE FOR THE NUMBER OF SYMBOL COMPARISONS USED BY QUICKSELECT
- THE LIMITING DISTRIBUTION FOR THE NUMBER OF SYMBOL COMPARISONS USED BY QUICKSORT IS
