☰

James A. Fill - Publications

Affiliations: 
Applied Mathematics and Statistics Johns Hopkins University, Baltimore, MD 
Area:
Applied Mathematics, Mathematics
Tree Info Similar researchers PubMed Report error

48 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
2019 Fill JA, Hung W. QuickSort: Improved right-tail asymptotics for the limiting distribution, and large deviations Electronic Journal of Probability. 24. DOI: 10.1214/19-Ejp331  0.343
2016 Clément J, Fill JA, Nguyen Thi TH, Vallée B. Towards a Realistic Analysis of the QuickSelect Algorithm Theory of Computing Systems. 58: 528-578. DOI: 10.1007/S00224-015-9633-5  0.354
2015 Fill JA, Lyzinski V. Strong Stationary Duality for Diffusion Processes Journal of Theoretical Probability. DOI: 10.1007/S10959-015-0612-1  0.635
2014 Fill JA, Matterer J. 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. 23: 805-828. DOI: 10.1017/S0963548314000121  0.415
2014 Fill JA, Lyzinski V. Hitting Times and Interlacing Eigenvalues: A Stochastic Approach Using Intertwinings Journal of Theoretical Probability. 27: 954-981. DOI: 10.1007/S10959-012-0457-9  0.674
2013 Fill JA, Nakama T. Distributional convergence for the number of symbol comparisons used by QuickSelect Advances in Applied Probability. 45: 425-450. DOI: 10.1239/Aap/1370870125  0.383
2013 Fill JA, Kahn J. Comparison inequalities and fastest-mixing Markov chains Annals of Applied Probability. 23: 1778-1816. DOI: 10.1214/12-Aap886  0.381
2013 Fill JA. Distributional convergence for the number of symbol comparisons used by quicksort Annals of Applied Probability. 23: 1129-1147. DOI: 10.1214/12-Aap866  0.402
2010 Fill JA, Huber ML. Perfect simulation of Vervaat perpetuities Electronic Communications in Probability. 15: 96-109. DOI: 10.1214/Ejp.V15-734  0.308
2009 Fill JA. The passage time distribution for a birth-and-death chain: Strong stationary duality gives a first stochastic proof Journal of Theoretical Probability. 22: 543-557. DOI: 10.1007/S10959-009-0235-5  0.441
2009 Fill JA. On hitting times and fastest strong stationary times for skip-free and more general chains Journal of Theoretical Probability. 22: 587-600. DOI: 10.1007/S10959-009-0233-7  0.427
2009 Fill JA, Janson S. Precise logarithmic asymptotics for the right tails of some limit random variables for random trees Annals of Combinatorics. 12: 403-416. DOI: 10.1007/S00026-009-0006-0  0.399
2008 Fill JA, Wilson DB. Two-player Knock 'em Down Electronic Journal of Probability. 13: 198-212. DOI: 10.1214/Ejp.V13-485  0.351
2006 Fill JA, Kapur N, Panholzer A. Destruction of very simple trees Algorithmica (New York). 46: 345-366. DOI: 10.1007/S00453-006-0100-1  0.331
2005 Fill JA, Flajolet P, Kapur N. Singularity analysis, Hadamard products, and tree recurrences Journal of Computational and Applied Mathematics. 174: 271-313. DOI: 10.1016/J.Jcam.2004.04.014  0.311
2005 Fill JA, Kapur N. Transfer theorems and asymptotic distributional results for m-ary search trees Random Structures and Algorithms. 26: 359-391. DOI: 10.1002/Rsa.V26:4  0.339
2004 Fill JA, Janson S. The Number of Bit Comparisons Used by Quicksort: An Average-case Analysis Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 15: 293-300. DOI: 10.1214/Ejp.V17-1812  0.314
2004 Fill JA, Kapur N. Limiting distributions for additive functionals on Catalan trees Theoretical Computer Science. 326: 69-102. DOI: 10.1016/J.Tcs.2004.05.010  0.378
2003 Dobrow RP, Fill JA. Speeding up the FMMR Perfect Sampling Algorithm: A Case Study Revisited Random Structures and Algorithms. 23: 434-452. DOI: 10.1002/Rsa.10096  0.419
2002 Crank K, Fill JA. Interruptible Exact Sampling in the Passive Case Methodology and Computing in Applied Probability. 4: 359-376. DOI: 10.1023/A:1023514501208  0.359
2001 Fill JA, Schoolfield CH. Mixing times for Markov chains on wreath products and related homogeneous spaces Electronic Journal of Probability. 6: 1-22. DOI: 10.1214/Ejp.V6-84  0.367
2001 Fill JA, Machida M. Stochastic monotonicity and realizable monotonicity Annals of Probability. 29: 938-978. DOI: 10.1214/Aop/1008956698  0.374
2001 Fill JA, Janson S. Approximating the limiting quicksort distribution Random Structures and Algorithms. 19: 376-406. DOI: 10.1002/Rsa.10007  0.409
2000 Devroye L, Fill JA, Neininger R. Perfect simulation from the quicksort limit distribution Electronic Communications in Probability. 5: 95-99. DOI: 10.1214/Ecp.V5-1024  0.377
2000 Fill JA, Janson S. A characterization of the set of fixed points of the Quicksort transformation Electronic Communications in Probability. 5: 77-84. DOI: 10.1214/Ecp.V5-1021  0.368
2000 Fill JA, Machida M, Murdoch DJ, Rosenthal JS. Extension of fill's perfect rejection sampling algorithm to general chains Random Structures and Algorithms. 17: 290-316. DOI: 10.1002/1098-2418(200010/12)17:3/4<290::Aid-Rsa6>3.0.Co;2-Q  0.357
1999 Dobrow RP, Fill JA. Total Path Length for Random Recursive Trees Combinatorics Probability and Computing. 8: 317-333. DOI: 10.1017/S0963548399003855  0.401
1998 Fill JA. An interruptible algorithm for perfect sampling via Markov chains Annals of Applied Probability. 8: 131-162. DOI: 10.1214/Aoap/1027961037  0.327
1998 Fill JA. The move-to-front rule: A case study for two perfect sampling algorithms Probability in the Engineering and Informational Sciences. 12: 283-302. DOI: 10.1017/S0269964800005192  0.313
1997 Dette H, Fill JA, Pitman J, Studden WJ. Wall and Siegmund Duality Relations for Birth and Death Chains with Reflecting Barrier Journal of Theoretical Probability. 10: 349-374. DOI: 10.1023/A:1022660400024  0.329
1997 Fill JA, Dobrow RP. The Number of m-ary Search Trees on n Keys Combinatorics Probability and Computing. 6: 435-453. DOI: 10.1017/S0963548397003118  0.312
1996 Fill JA, Mahmoud HM, Szpankowski W. On the distribution for the duration of a randomized leader election algorithm Annals of Applied Probability. 6: 1260-1283. DOI: 10.1214/Aoap/1035463332  0.396
1996 Dobrow RP, Fill JA. Multiway trees of maximum and minimum probability under the random permutation model Combinatorics Probability and Computing. 5: 351-371. DOI: 10.1017/S096354830000211X  0.337
1996 Fill JA. Limits and rates of convergence for the distribution of search cost under the move-to-front rule Theoretical Computer Science. 164: 185-206. DOI: 10.1016/0304-3975(95)00210-3  0.396
1996 Fill JA. An exact formula for the move-to-front rule for self-organizing lists Journal of Theoretical Probability. 9: 113-160. DOI: 10.1007/Bf02213737  0.405
1996 Fill JA, Holst L. On the distribution of search cost for the move-to-front rule Random Structures and Algorithms. 8: 179-186. DOI: 10.1002/(Sici)1098-2418(199605)8:3<179::Aid-Rsa2>3.0.Co;2-V  0.37
1996 Fill JA. On the distribution of binary search trees under the random permutation model Random Structures and Algorithms. 8: 1-25. DOI: 10.1002/(Sici)1098-2418(199601)8:1<1::Aid-Rsa1>3.0.Co;2-1  0.365
1995 Dobrow RP, Fill JA. Rates of Convergence for the Move-to-Root Markov Chain for Binary Search Trees Annals of Applied Probability. 5: 20-36. DOI: 10.1214/Aoap/1177004825  0.334
1995 Dobrow RP, Fill JA. On the Markov Chain for the Move-to-Root Rule for Binary Search Trees Annals of Applied Probability. 5: 1-19. DOI: 10.1214/Aoap/1177004824  0.325
1993 Fill JA, Pemantle R. Percolation, First-Passage Percolation and Covering Times for Richardson's Model on the $n$-Cube Annals of Applied Probability. 3: 593-629. DOI: 10.1214/Aoap/1177005440  0.342
1992 Diaconis P, Fill JA, Pitman J. Analysis of Top To Random Shuffles Combinatorics, Probability and Computing. 1: 135-155. DOI: 10.1017/S0963548300000158  0.366
1992 Fill JA. Strong stationary duality for continuous-time Markov chains. Part I: Theory Journal of Theoretical Probability. 5: 45-70. DOI: 10.1007/Bf01046778  0.39
1991 Fill JA. Eigenvalue Bounds on Convergence to Stationarity for Nonreversible Markov Chains, with an Application to the Exclusion Process Annals of Applied Probability. 1: 62-87. DOI: 10.1214/Aoap/1177005981  0.373
1991 Fill JA. Time to Stationarity for a Continuous-Time Markov Chain Probability in the Engineering and Informational Sciences. 5: 61-76. DOI: 10.1017/S0269964800001893  0.331
1990 Diaconis P, Fill JA. Examples for the theory of strong stationary duality with countable state spaces Probability in the Engineering and Informational Sciences. 4: 157-180. DOI: 10.1017/S0269964800001522  0.359
1989 Fill JA, Wichura MJ. The convergence rate for the strong law of large numbers: General lattice distributions Probability Theory and Related Fields. 81: 189-212. DOI: 10.1016/0304-4149(87)90123-2  0.373
1989 Fill JA. Asymptotic expansions for large deviation probabilities in the strong law of large numbers Probability Theory and Related Fields. 81: 213-233. DOI: 10.1007/Bf00319551  0.372
1984 Fill JA, Johnstone I. On Projection Pursuit Measures of Multivariate Location and Dispersion The Annals of Statistics. 12: 127-141. DOI: 10.1214/Aos/1176346397  0.335
Show low-probability matches.