James Allen Fill

From MaRDI portal
(Redirected from Person:187944)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
The randomness recycler: a new technique for perfect sampling2026-05-08Paper
Sharpened localization of the trailing point of the Pareto record frontier
Theoretical Computer Science
2026-03-20Paper
Sharpened localization of the trailing point of the Pareto record frontier2026-01-30Paper
Convergence of the QuickVal residual
Combinatorics, Probability and Computing
2025-12-30Paper
On the probability of a Pareto record
Probability in the Engineering and Informational Sciences
2025-07-07Paper
Conditioned Galton-Watson trees: the shape functional, and more on the sum of powers of subtree sizes and its mean
La Matematica
2024-06-28Paper
Breaking multivariate records
Electronic Journal of Probability
2023-08-02Paper
Corrigendum to: ``The sum of powers of subtree sizes for conditioned Galton-Watson trees''
Electronic Journal of Probability
2023-07-04Paper
Density functions for \texttt{QuickQuant} and \texttt{QuickVal}
Electronic Journal of Probability
2023-01-23Paper
Conditioned Galton-Watson trees: The shape functional, and more on the sum of powers of subtree sizes and its mean2022-12-21Paper
The sum of powers of subtree sizes for conditioned Galton-Watson trees
Electronic Journal of Probability
2022-10-04Paper
The sum of powers of subtree sizes for conditioned Galton-Watson trees
Electronic Journal of Probability
2022-10-04Paper
Density functions for QuickQuant and QuickVal
(available as arXiv preprint)
2021-09-29Paper
On the tails of the limiting QuickSort density2021-06-15Paper
Breaking bivariate records
Combinatorics, Probability and Computing
2021-06-15Paper
The Pareto record frontier
Electronic Journal of Probability
2020-09-29Paper
The Pareto record frontier
Electronic Journal of Probability
2020-09-29Paper
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-18Paper
On vertex, edge, and vertex-edge random graphs (extended abstract)
2011 Proceedings of the Eighth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-16Paper
Analysis of the expected number of bit comparisons required by Quickselect
2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-16Paper
QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
Electronic Journal of Probability
2019-08-06Paper
QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations
Electronic Journal of Probability
2019-08-06Paper
On the tails of the limiting QuickSort density
Electronic Communications in Probability
2019-02-14Paper
On the tails of the limiting QuickSort density
Electronic Communications in Probability
2019-02-14Paper
Generating Pareto records2019-01-17Paper
Distributional convergence for the number of symbol comparisons used by QuickSort (extended abstract)2017-02-10Paper
A local limit theorem for Quicksort key comparisons via multi-round smoothing2017-01-16Paper
Strong stationary duality for diffusion processes
Journal of Theoretical Probability
2017-01-10Paper
Towards a realistic analysis of the QuickSelect algorithm
Theory of Computing Systems
2016-06-03Paper
The number of bit comparisons used by Quicksort, an average-case analysis2015-08-03Paper
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings
Journal of Theoretical Probability
2014-11-17Paper
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract).
(available as arXiv preprint)
2014-09-29Paper
Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract).2014-09-29Paper
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract).
(available as arXiv preprint)
2014-09-29Paper
The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract).2014-09-29Paper
Quickselect tree process convergence, with an application to distributional convergence for the number of symbol comparisons used by worst-case find
Combinatorics, Probability and Computing
2014-09-24Paper
Comparison inequalities and fastest-mixing Markov chains
The Annals of Applied Probability
2013-10-25Paper
Comparison inequalities and fastest-mixing Markov chains
The Annals of Applied Probability
2013-10-25Paper
Distributional convergence for the number of symbol comparisons used by QuickSelect
Advances in Applied Probability
2013-07-11Paper
Distributional convergence for the number of symbol comparisons used by QuickSelect
Advances in Applied Probability
2013-07-11Paper
Distributional convergence for the number of symbol comparisons used by QuickSort
The Annals of Applied Probability
2013-05-10Paper
Distributional convergence for the number of symbol comparisons used by QuickSort
The Annals of Applied Probability
2013-05-10Paper
The number of bit comparisons used by quicksort: an average-case analysis
Electronic Journal of Probability
2012-06-22Paper
Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf
The Electronic Journal of Combinatorics
2012-06-12Paper
Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf
The Electronic Journal of Combinatorics
2012-06-12Paper
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees
Annals of Combinatorics
2012-01-24Paper
On vertex, edge, and vertex-edge random graphs
The Electronic Journal of Combinatorics
2011-06-01Paper
On vertex, edge, and vertex-edge random graphs
The Electronic Journal of Combinatorics
2011-06-01Paper
On vertex, edge, and vertex-edge random graphs
The Electronic Journal of Combinatorics
2011-06-01Paper
Analysis of the expected number of bit comparisons required by quickselect
Algorithmica
2010-09-27Paper
Perfect simulation of Vervaat perpetuities
Electronic Journal of Probability
2010-04-30Paper
Perfect simulation of Vervaat perpetuities
Electronic Journal of Probability
2010-04-30Paper
Perfect simulation of Vervaat perpetuities
Electronic Journal of Probability
2010-04-30Paper
Two-player knock 'em down
Electronic Journal of Probability
2009-11-20Paper
Two-player knock 'em down
Electronic Journal of Probability
2009-11-20Paper
Two-player knock 'em down
Electronic Journal of Probability
2009-11-20Paper
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof
Journal of Theoretical Probability
2009-09-25Paper
On hitting times and fastest strong stationary times for skip-free and more general chains
Journal of Theoretical Probability
2009-09-25Paper
The Number of Symbol Comparisons in QuickSort and QuickSelect
Automata, Languages and Programming
2009-07-14Paper
Realizable monotonocity and inverse probability transform
(available as arXiv preprint)
2008-05-14Paper
Destruction of very simple trees
Algorithmica
2007-02-14Paper
Time to Stationarity for a Continuous-Time Markov Chain
Probability in the Engineering and Informational Sciences
2007-01-19Paper
Examples for the Theory of Strong Stationary Duality with Countable State Spaces
Probability in the Engineering and Informational Sciences
2007-01-19Paper
A repertoire for additive functionals of uniformly distributed m-ary search trees
(available as arXiv preprint)
2006-08-29Paper
Transfer theorems and asymptotic distributional results for m‐ary search trees
Random Structures & Algorithms
2005-08-29Paper
Singularity analysis, Hadamard products, and tree recurrences
Journal of Computational and Applied Mathematics
2005-02-23Paper
Limiting distributions for additive functionals on Catalan trees
Theoretical Computer Science
2005-01-11Paper
Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
2004-11-05Paper
The space requirement of m-ary search trees: distributional asymptotics for m >= 272004-05-08Paper
Speeding up the FMMR perfect sampling algorithm: A case study revisited
Random Structures & Algorithms
2004-02-03Paper
Interruptible exact sampling in the passive case
Methodology and Computing in Applied Probability
2003-08-06Paper
Stochastic monotonicity and realizable monotonicity
The Annals of Probability
2003-05-06Paper
Quicksort asymptotics
Journal of Algorithms
2003-03-23Paper
Approximating the limiting quicksort distribution
Random Structures & Algorithms
2002-02-19Paper
The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms
Probability in the Engineering and Informational Sciences
2002-02-04Paper
Mixing times for Markov chains on wreath products and related homogeneous spaces
Electronic Journal of Probability
2001-08-01Paper
Mixing times for Markov chains on wreath products and related homogeneous spaces
Electronic Journal of Probability
2001-08-01Paper
Mixing times for Markov chains on wreath products and related homogeneous spaces
Electronic Journal of Probability
2001-08-01Paper
scientific article; zbMATH DE number 1560248 (Why is no real title available?)
(available as arXiv preprint)
2001-04-26Paper
scientific article; zbMATH DE number 1552325 (Why is no real title available?)2001-03-19Paper
scientific article; zbMATH DE number 1559585 (Why is no real title available?)2001-03-01Paper
scientific article; zbMATH DE number 1545677 (Why is no real title available?)
(available as arXiv preprint)
2000-12-19Paper
Random intersection graphs whenm=?(n): An equivalence theorem relating the evolution of theG(n,m,p) andG(n,p) models2000-12-13Paper
Total Path Length for Random Recursive Trees
Combinatorics, Probability and Computing
2000-10-23Paper
The Randomness Recycler: A new technique for perfect sampling2000-09-29Paper
Perfect simulation from the quicksort limit distribution
Electronic Communications in Probability
2000-07-27Paper
Perfect simulation from the quicksort limit distribution
Electronic Communications in Probability
2000-07-27Paper
A characterization of the set of fixed points of the quicksort transformation
Electronic Communications in Probability
2000-07-27Paper
A characterization of the set of fixed points of the quicksort transformation
Electronic Communications in Probability
2000-07-27Paper
The Moore--Penrose Generalized Inverse for Sums of Matrices
SIAM Journal on Matrix Analysis and Applications
2000-03-20Paper
Affine isomorphism for partially ordered sets
Order
2000-02-14Paper
An interruptible algorithm for perfect sampling via Markov chains
The Annals of Applied Probability
1999-08-02Paper
The Number of m-ary Search Trees on n Keys
Combinatorics, Probability and Computing
1998-05-25Paper
Wall and Siegmund duality relations for birth and death chains with reflecting barrier
Journal of Theoretical Probability
1997-10-07Paper
On the distribution for the duration of a randomized leader election algorithm
The Annals of Applied Probability
1997-06-12Paper
Limits and rates of convergence for the distribution of search cost under the move-to-front rule
Theoretical Computer Science
1997-02-27Paper
Multiway trees of maximum and minimum probability under the random permutation model
Combinatorics, Probability and Computing
1997-02-20Paper
scientific article; zbMATH DE number 903457 (Why is no real title available?)1996-12-08Paper
scientific article; zbMATH DE number 852055 (Why is no real title available?)1996-06-18Paper
An exact formula for the move-to-front rule for self-organizing lists
Journal of Theoretical Probability
1996-05-20Paper
scientific article; zbMATH DE number 795110 (Why is no real title available?)1995-11-26Paper
On the Markov chain for the move-to-root rule for binary search trees
The Annals of Applied Probability
1995-08-10Paper
Rates of convergence for the move-to-root Markov chain for binary search trees
The Annals of Applied Probability
1995-08-10Paper
Analysis of Top To Random Shuffles
Combinatorics, Probability and Computing
1994-05-05Paper
Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube
The Annals of Applied Probability
1993-10-28Paper
Strong stationary duality for continuous-time Markov chains. I: Theory
Journal of Theoretical Probability
1992-06-28Paper
Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process
The Annals of Applied Probability
1991-01-01Paper
Strong stationary times via a new form of duality
The Annals of Probability
1990-01-01Paper
Asymptotic expansions for large deviation probabilities in the strong law of large numbers
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
1989-01-01Paper
The Radon Transform on $\mathbb{Z}_n $
SIAM Journal on Discrete Mathematics
1989-01-01Paper
The convergence rate for the strong law of large numbers: General lattice distributions
Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete
1989-01-01Paper
Bounds on the coarseness of random sums
The Annals of Probability
1988-01-01Paper
On projection pursuit measures of multivariate location and dispersion
The Annals of Statistics
1984-01-01Paper
Convergence rates related to the strong law of large numbers
The Annals of Probability
1983-01-01Paper
Invariance properties of Schoenberg's tone row system
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
1980-01-01Paper
The structure of RI-invariant tweleve-tone rows
The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
1980-01-01Paper
scientific article; zbMATH DE number 3573251 (Why is no real title available?)1977-01-01Paper
On the probability of a Pareto record
(available as arXiv preprint)
N/APaper
Sharpened localization of the trailing point of the Pareto record frontier
(available as arXiv preprint)
N/APaper


Research outcomes over time


This page was built for person: James Allen Fill