The following pages link to James Allen Fill (Q187944):
Displaying 50 items.
- Towards a realistic analysis of the QuickSelect algorithm (Q290901) (← links)
- Comparison inequalities and fastest-mixing Markov chains (Q373832) (← links)
- Partitions with distinct multiplicities of parts: on an ``unsolved problem'' posed by Herbert Wilf (Q426887) (← links)
- The number of bit comparisons used by quicksort: an average-case analysis (Q428664) (← links)
- Hitting times and interlacing eigenvalues: a stochastic approach using intertwinings (Q471527) (← links)
- Strong stationary duality for diffusion processes (Q501820) (← links)
- On vertex, edge, and vertex-edge random graphs (Q540120) (← links)
- Precise logarithmic asymptotics for the right tails of some limit random variables for random trees (Q659772) (← links)
- Limits and rates of convergence for the distribution of search cost under the move-to-front rule (Q671429) (← links)
- Percolation, first-passage percolation and covering times for Richardson's model on the \(n\)-cube (Q687712) (← links)
- Limiting distributions for additive functionals on Catalan trees (Q703536) (← links)
- Strong stationary times via a new form of duality (Q756859) (← links)
- On projection pursuit measures of multivariate location and dispersion (Q794103) (← links)
- Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process (Q804091) (← links)
- On hitting times and fastest strong stationary times for skip-free and more general chains (Q842402) (← links)
- The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof (Q842404) (← links)
- Destruction of very simple trees (Q866949) (← links)
- Perfect simulation of Vervaat perpetuities (Q967720) (← links)
- Two-player knock 'em down (Q1039012) (← links)
- The convergence rate for the strong law of large numbers: General lattice distributions (Q1102029) (← links)
- Asymptotic expansions for large deviation probabilities in the strong law of large numbers (Q1102030) (← links)
- Bounds on the coarseness of random sums (Q1109406) (← links)
- Convergence rates related to the strong law of large numbers (Q1172864) (← links)
- Strong stationary duality for continuous-time Markov chains. I: Theory (Q1185795) (← links)
- An interruptible algorithm for perfect sampling via Markov chains (Q1296621) (← links)
- Affine isomorphism for partially ordered sets (Q1300339) (← links)
- On the distribution for the duration of a randomized leader election algorithm (Q1354843) (← links)
- Wall and Siegmund duality relations for birth and death chains with reflecting barrier (Q1368993) (← links)
- Interruptible exact sampling in the passive case (Q1398013) (← links)
- A characterization of the set of fixed points of the quicksort transformation (Q1572749) (← links)
- Perfect simulation from the quicksort limit distribution (Q1572752) (← links)
- On the tails of the limiting QuickSort density (Q1725502) (← links)
- Singularity analysis, Hadamard products, and tree recurrences (Q1765441) (← links)
- Stochastic monotonicity and realizable monotonicity (Q1872211) (← links)
- Asymptotic analysis via Mellin transforms for small deviations in \(L^2\)-norm of integrated Brownian sheets (Q1884727) (← links)
- On the Markov chain for the move-to-root rule for binary search trees (Q1894612) (← links)
- Rates of convergence for the move-to-root Markov chain for binary search trees (Q1894613) (← links)
- An exact formula for the move-to-front rule for self-organizing lists (Q1908208) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSort (Q1950265) (← links)
- Analysis of the expected number of bit comparisons required by quickselect (Q1957651) (← links)
- The sum of powers of subtree sizes for conditioned Galton-Watson trees (Q2082709) (← links)
- The Pareto record frontier (Q2201506) (← links)
- QuickSort: improved right-tail asymptotics for the limiting distribution, and large deviations (Q2316591) (← links)
- Density functions for \texttt{QuickQuant} and \texttt{QuickVal} (Q2679697) (← links)
- Approximating the limiting quicksort distribution (Q2772925) (← links)
- Multiway trees of maximum and minimum probability under the random permutation model (Q2785369) (← links)
- Distributional convergence for the number of symbol comparisons used by QuickSelect (Q2837754) (← links)
- Exact \(L^2\)-distance from the limit for QuickSort key comparisons (extended abstract). (Q2920866) (← links)
- The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract). (Q2920867) (← links)
- (Q2959907) (← links)
