James Allen Fill

Publication Activity (10 Years)

Years Active: 1989-2024
Publications (10 Years): 13

Top Topics

Multiobjective Optimization

Pareto Optimality

Extended Abstract

Top Venues

Comb. Probab. Comput.

Theory Comput. Syst.

Publications

James Allen Fill, Daniel Q. Naiman, Ao Sun
Sharpened Localization of the Trailing Point of the Pareto Record Frontier. AofA (2024)
James Allen Fill, Daniel Q. Naiman, Ao Sun
Sharpened localization of the trailing point of the Pareto record frontier. CoRR (2024)
James Allen Fill, Ao Sun
On the probability of a Pareto record. CoRR (2024)
James Allen Fill, Wei-Chun Hung
Density functions for QuickQuant and QuickVal. CoRR (2021)
James Allen Fill
Breaking bivariate records. Comb. Probab. Comput. 30 (1) (2021)
James Allen Fill, Mark Daniel Ward
Special Issue on Analysis of Algorithms. Algorithmica 82 (3) (2020)
James Allen Fill, Wei-Chun Hung
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations. CoRR (2019)
James Allen Fill, Wei-Chun Hung
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract). ANALCO (2019)
James Allen Fill, Daniel Q. Naiman
The Pareto Record Frontier. CoRR (2019)
James Allen Fill, Daniel Q. Naiman
Generating Pareto records. CoRR (2019)
James Allen Fill, Wei-Chun Hung
On the tails of the limiting QuickSort density. CoRR (2018)
James Allen Fill, Wei-Chun Hung
On the Tails of the Limiting QuickSort Density. AofA (2018)
Julien Clément, James Allen Fill, Thu Hien Nguyen Thi, Brigitte Vallée
Towards a Realistic Analysis of the QuickSelect Algorithm. Theory Comput. Syst. 58 (4) (2016)
James Allen Fill, Jason Matterer
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find. Comb. Probab. Comput. 23 (5) (2014)
Patrick Bindjeme, James Allen Fill
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract) CoRR (2012)
James Allen Fill
Distributional convergence for the number of symbol comparisons used by QuickSort CoRR (2012)
James Allen Fill, Svante Janson, Mark Daniel Ward
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf CoRR (2012)
James Allen Fill, Takéhiko Nakama
Distributional convergence for the number of symbol comparisons used by QuickSelect CoRR (2012)
James Allen Fill, Svante Janson
The number of bit comparisons used by Quicksort: an average-case analysis CoRR (2012)
James Allen Fill, Svante Janson, Mark Daniel Ward
Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electron. J. Comb. 19 (2) (2012)
Patrick Bindjeme, James Allen Fill
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract) CoRR (2012)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO (2011)
Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman
On Vertex, Edge, and Vertex-Edge Random Graphs. Electron. J. Comb. 18 (1) (2011)
James Allen Fill, Takéhiko Nakama
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. Algorithmica 58 (3) (2010)
Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet
The Number of Symbol Comparisons in QuickSort and QuickSelect. ICALP (1) (2009)
James Allen Fill, Takéhiko Nakama
Analysis of the Expected Number of Bit Comparisons Required by Quickselect. ANALCO (2008)
James Allen Fill, Nevin Kapur, Alois Panholzer
Destruction of Very Simple Trees. Algorithmica 46 (3-4) (2006)
James Allen Fill, Nevin Kapur
Transfer theorems and asymptotic distributional results for m-ary search trees. Random Struct. Algorithms 26 (4) (2005)
James Allen Fill, Svante Janson
The number of bit comparisons used by Quicksort: an average-case analysis. SODA (2004)
James Allen Fill, Nevin Kapur
Limiting distributions for additive functionals on Catalan trees. Theor. Comput. Sci. 326 (1-3) (2004)
Robert P. Dobrow, James Allen Fill
Speeding up the FMMR perfect sampling algorithm: A case study revisited. Random Struct. Algorithms 23 (4) (2003)
James Allen Fill, Svante Janson
Quicksort asymptotics. J. Algorithms 44 (1) (2002)
James Allen Fill, Svante Janson
Approximating the limiting Quicksort distribution. Random Struct. Algorithms 19 (3-4) (2001)
Luc Devroye, James Allen Fill, Ralph Neininger
Perfect simulation from the Quicksort limit distribution CoRR (2000)
James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen
Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Struct. Algorithms 16 (2) (2000)
James Allen Fill, Svante Janson
A characterization of the set of fixed points of the Quicksort transformation CoRR (2000)
James Allen Fill, Mark Huber
The Randomness Recycler: A New Technique for Perfect Sampling. FOCS (2000)
James Allen Fill, Svante Janson
Smoothness and decay properties of the limiting Quicksort density function CoRR (2000)
James Allen Fill, Donniell E. Fishkind
The Moore-Penrose Generalized Inverse for Sums of Matrices. SIAM J. Matrix Anal. Appl. 21 (2) (2000)
James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal
Extension of Fill's perfect rejection sampling algorithm to general chains. Random Struct. Algorithms 17 (3-4) (2000)
Robert P. Dobrow, James Allen Fill
Total Path Length For Random Recursive Trees. Comb. Probab. Comput. 8 (4) (1999)
James Allen Fill
An Interruptible Algorithm for Perfect Sampling via Markov Chains. STOC (1997)
James Allen Fill, Robert P. Dobrow
The Number of m-ary Search Trees on n Keys. Comb. Probab. Comput. 6 (4) (1997)
James Allen Fill
On the distribution of binary search trees under the random permutation model. Random Struct. Algorithms 8 (1) (1996)
James Allen Fill
Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. Theor. Comput. Sci. 164 (1&2) (1996)
James Allen Fill, Lars Holst
On the distribution of search cost for the move-to-front rule. Random Struct. Algorithms 8 (3) (1996)
Robert P. Dobrow, James Allen Fill
Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. Comb. Probab. Comput. 5 (1996)
Persi Diaconis, James Allen Fill, Jim Pitman
Analysis of Top To Random Shuffles. Comb. Probab. Comput. 1 (1992)
James Allen Fill
. SIAM J. Discret. Math. 2 (2) (1989)