Publications (42)
The number of bit comparisons used by Quicksort: an average-case analysis
James Allen Fill, Svante Janson
Smoothness and decay properties of the limiting Quicksort density function
James Allen Fill, Svante Janson
The Pareto Record Frontier
James Allen Fill, Daniel Q. Naiman
Perfect simulation of Vervaat perpetuities
James Allen Fill, Mark Huber
Generating Pareto records
James Allen Fill, Daniel Q. Naiman
Quicksort asymptotics
James Allen Fill, Svante Janson
Realizable monotonicity and inverse probability transform
James Allen Fill, Motoya Machida
On hitting times and fastest strong stationary times for skip-free and more general chains
James Allen Fill
Analysis of the expected number of bit comparisons required by Quickselect
James Allen Fill, Take Nakama
A characterization of the set of fixed points of the Quicksort transformation
James Allen Fill, Svante Janson
Strong Stationary Duality for Diffusion Processes
James Allen Fill, Vince Lyzinski
Interruptible exact sampling in the passive case
Keith Crank, James Allen Fill
On the tails of the limiting QuickSort density
James Allen Fill, Wei-Chun Hung
A local limit theorem for Quicksort key comparisons via multi-round smoothing
Béla Bollobás, James Allen Fill, Oliver Riordan
On vertex, edge, and vertex-edge random graphs
Elizabeth Beer, James Allen Fill, Svante Janson +1
Percolation, first-passage percolation, and covering times for Richardson's model on the n-cube
James Allen Fill, Robin Pemantle
Extension of Fill's perfect rejection sampling algorithm to general chains (Extended abstract)
James Allen Fill, Motoya Machida, Duncan J. Murdoch +1
Comparison inequalities and fastest-mixing Markov chains
James Allen Fill, Jonas Kahn
Two-player Knock 'em Down
James Allen Fill, David B. Wilson
A repertoire for additive functionals of uniformly distributed m-ary search trees
James Allen Fill, Nevin Kapur
Distributional convergence for the number of symbol comparisons used by QuickSelect
James Allen Fill, Takehiko Nakama
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
James Allen Fill, Vince Lyzinski
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf
James Allen Fill, Svante Janson, Mark Daniel Ward
Stochastic monotonicity and realizable monotonicity
James Allen Fill, Motoya Machida
Mixing times for Markov chains on wreath products and related homogeneous spaces
James Allen Fill, Clyde H. Schoolfield
Extension of Fill's perfect rejection sampling algorithm to general chains
James Allen Fill, Motoya Machida, Duncan J. Murdoch +1
Approximating the limiting Quicksort distribution
James Allen Fill, Svante Janson
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
James Allen Fill
Limiting distributions for additive functionals on Catalan trees
James Allen Fill, Nevin Kapur
The Randomness Recycler: A new technique for perfect sampling
James Allen Fill, Mark L. Huber
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract)
Patrick Bindjeme, James Allen Fill
Asymptotic analysis via Mellin transforms for small deviations in $L^2$-norm of integrated Brownian sheets
James Allen Fill, Fred Torcaso
Distributional convergence for the number of symbol comparisons used by QuickSort
James Allen Fill
Speeding up the FMMR perfect sampling algorithm: A case study revisited
Robert P. Dobrow, James Allen Fill
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
James Allen Fill, Svante Janson
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations
James Allen Fill, Wei-Chun Hung
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract)
Patrick Bindjeme, James Allen Fill
Transfer Theorems and Asymptotic Distributional Results for m-ary Search Trees
James Allen Fill, Nevin Kapur
Perfect simulation from the Quicksort limit distribution
Luc Devroye, James Allen Fill, Ralph Neininger
Destruction of very simple trees
James Allen Fill, Nevin Kapur, Alois Panholzer
The space requirement of m-ary search trees: distributional asymptotics for m >= 27
James Allen Fill, Nevin Kapur
Singularity analysis, Hadamard products, and tree recurrences
James Allen Fill, Philippe Flajolet, Nevin Kapur