Citation: P. Dobrow, Robert et Fill, James Allen, On the Markov Chain for the Move-to-Root Rule for Binary Search Trees, Annals of applied probability , 5(1), 1995, pp. 1-19
Citation: P. Dobrow, Robert et Fill, James Allen, Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees, Annals of applied probability , 5(1), 1995, pp. 20-36
Citation: Fill, James Allen, Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process, Annals of applied probability , 1(1), 1991, pp. 62-87
Citation: Fill, James Allen, An interruptible algorithm for perfect sampling via Markov chains, Annals of applied probability , 8(1), 1998, pp. 131-162
Citation: Fill, James Allen et Pemantle Robin, Percolation, First-Passage Percolation and Covering Times for Richardson's Model on the n-Cube, Annals of applied probability , 3(2), 1993, pp. 593-629
Citation: Fill, James Allen, Distributional convergence for the number of symbol comparisons used by QuickSort, Annals of applied probability , 23(3), 2013, pp. 1129-1147
Citation: Fill, James Allen et Kahn, Jonas, Comparison inequalities and fastest-mixing Markov chains, Annals of applied probability , 23(5), 2013, pp. 1778-1816