The Radon Transform on Zn. - James Allen Fill (SIAM J. Discret. Math., 1989)

Analysis of Top To Random Shuffles. - Persi Diaconis; James Allen Fill; Jim Pitman (Comb. Probab. Comput., 1992)

Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. - Robert P. Dobrow; James Allen Fill (Comb. Probab. Comput., 1996)

On the distribution of binary search trees under the random permutation model. - James Allen Fill (Random Struct. Algorithms, 1996)

On the distribution of search cost for the move-to-front rule. - James Allen Fill; Lars Holst (Random Struct. Algorithms, 1996)

Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. - James Allen Fill (Theor. Comput. Sci., 1996)

An Interruptible Algorithm for Perfect Sampling via Markov Chains. - James Allen Fill (STOC, 1997)

The Number of m-ary Search Trees on n Keys. - James Allen Fill; Robert P. Dobrow (Comb. Probab. Comput., 1997)

Total Path Length For Random Recursive Trees. - Robert P. Dobrow; James Allen Fill (Comb. Probab. Comput., 1999)

The Randomness Recycler: A New Technique for Perfect Sampling. - James Allen Fill; Mark Huber (FOCS, 2000)

Smoothness and decay properties of the limiting Quicksort density function - James Allen Fill; Svante Janson (CoRR, 2000)

A characterization of the set of fixed points of the Quicksort transformation - James Allen Fill; Svante Janson (CoRR, 2000)

Perfect simulation from the Quicksort limit distribution - Luc Devroye; James Allen Fill; Ralph Neininger (CoRR, 2000)

Extension of Fill's perfect rejection sampling algorithm to general chains. - James Allen Fill; Motoya Machida; Duncan J. Murdoch; Jeffrey S. Rosenthal (Random Struct. Algorithms, 2000)

Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. - James Allen Fill; Edward R. Scheinerman; Karen B. Singer-Cohen (Random Struct. Algorithms, 2000)

The Moore-Penrose Generalized Inverse for Sums of Matrices. - James Allen Fill; Donniell E. Fishkind (SIAM J. Matrix Anal. Appl., 2000)

Approximating the limiting Quicksort distribution. - James Allen Fill; Svante Janson (Random Struct. Algorithms, 2001)

Quicksort asymptotics. - James Allen Fill; Svante Janson (J. Algorithms, 2002)

Speeding up the FMMR perfect sampling algorithm: A case study revisited. - Robert P. Dobrow; James Allen Fill (Random Struct. Algorithms, 2003)

The number of bit comparisons used by Quicksort: an average-case analysis. - James Allen Fill; Svante Janson (SODA, 2004)

Limiting distributions for additive functionals on Catalan trees. - James Allen Fill; Nevin Kapur (Theor. Comput. Sci., 2004)

Transfer theorems and asymptotic distributional results for m-ary search trees. - James Allen Fill; Nevin Kapur (Random Struct. Algorithms, 2005)

Destruction of Very Simple Trees. - James Allen Fill; Nevin Kapur; Alois Panholzer (Algorithmica, 2006)

The Number of Symbol Comparisons in QuickSort and QuickSelect. - Brigitte Vallée; Julien Clément 001; James Allen Fill; Philippe Flajolet (ICALP (1), 2009)

Analysis of the Expected Number of Bit Comparisons Required by Quickselect. - James Allen Fill; Takéhiko Nakama (Algorithmica, 2010)

On Vertex, Edge, and Vertex-Edge Random Graphs. - Elizabeth Beer; James Allen Fill; Svante Janson; Edward R. Scheinerman (Electron. J. Comb., 2011)

Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. - James Allen Fill; Svante Janson; Mark Daniel Ward (Electron. J. Comb., 2012)

The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract) - Patrick Bindjeme; James Allen Fill (CoRR, 2012)

Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract) - Patrick Bindjeme; James Allen Fill (CoRR, 2012)

Distributional convergence for the number of symbol comparisons used by QuickSelect - James Allen Fill; Takéhiko Nakama (CoRR, 2012)

Distributional convergence for the number of symbol comparisons used by QuickSort - James Allen Fill (CoRR, 2012)

QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find. - James Allen Fill; Jason Matterer (Comb. Probab. Comput., 2014)

Towards a Realistic Analysis of the QuickSelect Algorithm. - Julien Clément 001; James Allen Fill; Thu Hien Nguyen Thi; Brigitte Vallée (Theory Comput. Syst., 2016)

On the Tails of the Limiting QuickSort Density. - James Allen Fill; Wei-Chun Hung (AofA, 2018)

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). - James Allen Fill; Wei-Chun Hung (ANALCO, 2019)

The Pareto Record Frontier. - James Allen Fill; Daniel Q. Naiman (CoRR, 2019)

Generating Pareto records. - James Allen Fill; Daniel Q. Naiman (CoRR, 2019)

QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations. - James Allen Fill; Wei-Chun Hung (CoRR, 2019)

Special Issue on Analysis of Algorithms. - James Allen Fill; Mark Daniel Ward (Algorithmica, 2020)

Density functions for QuickQuant and QuickVal. - James Allen Fill; Wei-Chun Hung (CoRR, 2021)

Breaking bivariate records. - James Allen Fill (Comb. Probab. Comput., 2021)

Sharpened Localization of the Trailing Point of the Pareto Record Frontier. - James Allen Fill; Daniel Q. Naiman; Ao Sun (AofA, 2024)

On the probability of a Pareto record. - James Allen Fill; Ao Sun (CoRR, 2024)

Convergence of the QuickVal Residual. - James Allen Fill; Jason Matterer (CoRR, 2024)