Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
James Allen Fill
2010 – today
- 2012
[j19]James Allen Fill, Svante Janson, Mark Daniel Ward: Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. Electr. J. Comb. 19(2): P18 (2012)- [i9]Patrick Bindjeme, James Allen Fill: The limiting distribution for the number of symbol comparisons used by QuickSort is nondegenerate (extended abstract). CoRR abs/1201.6444 (2012)
- [i8]Patrick Bindjeme, James Allen Fill: Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract). CoRR abs/1201.6445 (2012)
- [i7]James Allen Fill, Svante Janson: The number of bit comparisons used by Quicksort: an average-case analysis. CoRR abs/1202.2595 (2012)
- [i6]James Allen Fill, Takéhiko Nakama: Distributional convergence for the number of symbol comparisons used by QuickSelect. CoRR abs/1202.2599 (2012)
- [i5]James Allen Fill: Distributional convergence for the number of symbol comparisons used by QuickSort. CoRR abs/1202.2601 (2012)
- [i4]James Allen Fill, Svante Janson, Mark Daniel Ward: Partitions with Distinct Multiplicities of Parts: On An "Unsolved Problem" Posed By Herbert Wilf. CoRR abs/1203.2670 (2012)
- 2011
- [j18]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman: On Vertex, Edge, and Vertex-Edge Random Graphs. Electr. J. Comb. 18(1) (2011)
- [c6]Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman: On Vertex, Edge, and Vertex-edge Random Graphs. ANALCO 2011: 16-22
- 2010
- [j17]James Allen Fill, Takéhiko Nakama: Analysis of the Expected Number of Bit Comparisons Required by Quickselect. Algorithmica 58(3): 730-769 (2010)
2000 – 2009
- 2009
- [c5]Brigitte Vallée, Julien Clément, James Allen Fill, Philippe Flajolet: The Number of Symbol Comparisons in QuickSort and QuickSelect. ICALP (1) 2009: 750-763
- 2008
- [c4]James Allen Fill, Takéhiko Nakama: Analysis of the Expected Number of Bit Comparisons Required by Quickselect. ANALCO 2008: 249-256
- 2006
- [j16]James Allen Fill, Nevin Kapur, Alois Panholzer: Destruction of Very Simple Trees. Algorithmica 46(3-4): 345-366 (2006)
- 2005
- [j15]James Allen Fill, Nevin Kapur: Transfer theorems and asymptotic distributional results for m-ary search trees. Random Struct. Algorithms 26(4): 359-391 (2005)
- 2004
- [j14]James Allen Fill, Nevin Kapur: Limiting distributions for additive functionals on Catalan trees. Theor. Comput. Sci. 326(1-3): 69-102 (2004)
- [c3]James Allen Fill, Svante Janson: The number of bit comparisons used by Quicksort: an average-case analysis. SODA 2004: 300-307
- 2003
- [j13]Robert P. Dobrow, James Allen Fill: Speeding up the FMMR perfect sampling algorithm: A case study revisited. Random Struct. Algorithms 23(4): 434-452 (2003)
- 2002
- [j12]
- 2001
- [j11]James Allen Fill, Svante Janson: Approximating the limiting Quicksort distribution. Random Struct. Algorithms 19(3-4): 376-406 (2001)
- 2000
- [j10]James Allen Fill, Edward R. Scheinerman, Karen B. Singer-Cohen: Random intersection graphs when m=omega(n): An equivalence theorem relating the evolution of the G(n, m, p) and G(n, p) models. Random Struct. Algorithms 16(2): 156-176 (2000)
- [j9]James Allen Fill, Motoya Machida, Duncan J. Murdoch, Jeffrey S. Rosenthal: Extension of Fill's perfect rejection sampling algorithm to general chains. Random Struct. Algorithms 17(3-4): 290-316 (2000)
- [c2]James Allen Fill, Mark Huber: The Randomness Recycler: A New Technique for Perfect Sampling. FOCS 2000: 503-511
- [i3]James Allen Fill, Svante Janson: Smoothness and decay properties of the limiting Quicksort density function. CoRR math.PR/0005235 (2000)
- [i2]James Allen Fill, Svante Janson: A characterization of the set of fixed points of the Quicksort transformation. CoRR math.PR/0005236 (2000)
- [i1]Luc Devroye, James Allen Fill, Ralph Neininger: Perfect simulation from the Quicksort limit distribution. CoRR math.PR/0005237 (2000)
1990 – 1999
- 1999
- [j8]Robert P. Dobrow, James Allen Fill: Total Path Length For Random Recursive Trees. Combinatorics, Probability & Computing 8(4): 317-333 (1999)
- 1997
- [j7]James Allen Fill, Robert P. Dobrow: The Number of m-ary Search Trees on n Keys. Combinatorics, Probability & Computing 6(4): 435-453 (1997)
- [c1]James Allen Fill: An Interruptible Algorithm for Perfect Sampling via Markov Chains. STOC 1997: 688-695
- 1996
- [j6]Robert P. Dobrow, James Allen Fill: Multiway trees of Maximum and Minimum Probability under the Random Permutation Model. Combinatorics, Probability & Computing 5: 351-371 (1996)
- [j5]James Allen Fill: On the distribution of binary search trees under the random permutation model. Random Struct. Algorithms 8(1): 1-25 (1996)
- [j4]James Allen Fill, Lars Holst: On the distribution of search cost for the move-to-front rule. Random Struct. Algorithms 8(3): 179-186 (1996)
- [j3]James Allen Fill: Limits and Rates of Convergence for the Distribution of Search Cost Under the Move-to-Front Rule. Theor. Comput. Sci. 164(1&2): 185-206 (1996)
- 1992
- [j2]Persi Diaconis, James Allen Fill, Jim Pitman: Analysis of Top To Random Shuffles. Combinatorics, Probability & Computing 1: 135-155 (1992)
1980 – 1989
- 1989
- [j1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-13 23:05 CEST by the dblp team