James Allen Fill

From MaRDI portal
Person:187944

Available identifiers

zbMath Open fill.james-allenWikidataQ102111090 ScholiaQ102111090MaRDI QIDQ187944

List of research outcomes

PublicationDate of PublicationType
Breaking multivariate records2023-08-02Paper
Corrigendum to: ``The sum of powers of subtree sizes for conditioned Galton-Watson trees2023-07-04Paper
Density functions for \texttt{QuickQuant} and \texttt{QuickVal}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 trees2022-10-04Paper
Density functions for QuickQuant and QuickVal2021-09-29Paper
Breaking bivariate records2021-06-15Paper
https://portal.mardi4nfdi.de/entity/Q49935432021-06-15Paper
The Pareto record frontier2020-09-29Paper
QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations (Extended Abstract)2019-09-18Paper
Analysis of the expected number of bit comparisons required by quickselect2019-09-16Paper
On Vertex, Edge, and Vertex-Edge Random Graphs (Extended Abstract)2019-09-16Paper
QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations2019-08-06Paper
On the tails of the limiting QuickSort density2019-02-14Paper
Generating Pareto records2019-01-17Paper
https://portal.mardi4nfdi.de/entity/Q29599072017-02-10Paper
A local limit theorem for Quicksort key comparisons via multi-round smoothing2017-01-16Paper
Strong stationary duality for diffusion processes2017-01-10Paper
Towards a realistic analysis of the QuickSelect algorithm2016-06-03Paper
https://portal.mardi4nfdi.de/entity/Q55012712015-08-03Paper
Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings2014-11-17Paper
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)2014-09-29Paper
QuickSelect Tree Process Convergence, With an Application to Distributional Convergence for the Number of Symbol Comparisons Used by Worst-Case Find2014-09-24Paper
Comparison inequalities and fastest-mixing Markov chains2013-10-25Paper
Distributional Convergence for the Number of Symbol Comparisons Used by Quickselect2013-07-11Paper
Distributional convergence for the number of symbol comparisons used by QuickSort2013-05-10Paper
The number of bit comparisons used by quicksort: an average-case analysis2012-06-22Paper
Partitions with distinct multiplicities of parts: on an ``unsolved problem posed by Herbert Wilf2012-06-12Paper
Precise logarithmic asymptotics for the right tails of some limit random variables for random trees2012-01-24Paper
On vertex, edge, and vertex-edge random graphs2011-06-01Paper
Analysis of the expected number of bit comparisons required by quickselect2010-09-27Paper
Perfect simulation of Vervaat perpetuities2010-04-30Paper
Two-player knock 'em down2009-11-20Paper
On hitting times and fastest strong stationary times for skip-free and more general chains2009-09-25Paper
The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof2009-09-25Paper
The Number of Symbol Comparisons in QuickSort and QuickSelect2009-07-14Paper
https://portal.mardi4nfdi.de/entity/Q53864732008-05-14Paper
Destruction of very simple trees2007-02-14Paper
Examples for the Theory of Strong Stationary Duality with Countable State Spaces2007-01-19Paper
Time to Stationarity for a Continuous-Time Markov Chain2007-01-19Paper
https://portal.mardi4nfdi.de/entity/Q54853372006-08-29Paper
Transfer theorems and asymptotic distributional results for m‐ary search trees2005-08-29Paper
Singularity analysis, Hadamard products, and tree recurrences2005-02-23Paper
Limiting distributions for additive functionals on Catalan trees2005-01-11Paper
Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets2004-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 revisited2004-02-03Paper
Interruptible exact sampling in the passive case2003-08-06Paper
Stochastic monotonicity and realizable monotonicity2003-05-06Paper
Quicksort asymptotics2003-03-23Paper
Approximating the limiting Quicksort distribution2002-02-19Paper
The Move-to-Front Rule: A Case Study for two Perfect Sampling Algorithms2002-02-04Paper
Mixing times for Markov chains on wreath products and related homogeneous spaces2001-08-01Paper
https://portal.mardi4nfdi.de/entity/Q45270932001-04-26Paper
https://portal.mardi4nfdi.de/entity/Q45245682001-03-19Paper
https://portal.mardi4nfdi.de/entity/Q45270372001-03-01Paper
https://portal.mardi4nfdi.de/entity/Q45215502000-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 Trees2000-10-23Paper
The Randomness Recycler: A new technique for perfect sampling2000-09-29Paper
A characterization of the set of fixed points of the quicksort transformation2000-07-27Paper
Perfect simulation from the quicksort limit distribution2000-07-27Paper
The Moore--Penrose Generalized Inverse for Sums of Matrices2000-03-20Paper
Affine isomorphism for partially ordered sets2000-02-14Paper
An interruptible algorithm for perfect sampling via Markov chains1999-08-02Paper
The Number of m-ary Search Trees on n Keys1998-05-25Paper
Wall and Siegmund duality relations for birth and death chains with reflecting barrier1997-10-07Paper
On the distribution for the duration of a randomized leader election algorithm1997-06-12Paper
Limits and rates of convergence for the distribution of search cost under the move-to-front rule1997-02-27Paper
Multiway Trees of Maximum and Minimum Probability under the Random Permutation Model1997-02-20Paper
https://portal.mardi4nfdi.de/entity/Q48852231996-12-08Paper
https://portal.mardi4nfdi.de/entity/Q48682641996-06-18Paper
An exact formula for the move-to-front rule for self-organizing lists1996-05-20Paper
https://portal.mardi4nfdi.de/entity/Q48452591995-11-26Paper
On the Markov chain for the move-to-root rule for binary search trees1995-08-10Paper
Rates of convergence for the move-to-root Markov chain for binary search trees1995-08-10Paper
Analysis of Top To Random Shuffles1994-05-05Paper
Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube1993-10-28Paper
Strong stationary duality for continuous-time Markov chains. I: Theory1992-06-28Paper
Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process1991-01-01Paper
Strong stationary times via a new form of duality1990-01-01Paper
The convergence rate for the strong law of large numbers: General lattice distributions1989-01-01Paper
Asymptotic expansions for large deviation probabilities in the strong law of large numbers1989-01-01Paper
The Radon Transform on $\mathbb{Z}_n $1989-01-01Paper
Bounds on the coarseness of random sums1988-01-01Paper
On projection pursuit measures of multivariate location and dispersion1984-01-01Paper
Convergence rates related to the strong law of large numbers1983-01-01Paper
Invariance properties of Schoenberg's tone row system1980-01-01Paper
The structure of RI-invariant tweleve-tone rows1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41441931977-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: James Allen Fill