James Allen Fill

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