James Allen Fill

	2012
31		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)
30		Patrick Bindjeme, James Allen Fill: Exact L^2-distance from the limit for QuickSort key comparisons (extended abstract) CoRR abs/1201.6445: (2012)
29		James Allen Fill, Svante Janson: The number of bit comparisons used by Quicksort: an average-case analysis CoRR abs/1202.2595: (2012)
28		James Allen Fill, Takéhiko Nakama: Distributional convergence for the number of symbol comparisons used by QuickSelect CoRR abs/1202.2599: (2012)
27		James Allen Fill: Distributional convergence for the number of symbol comparisons used by QuickSort CoRR abs/1202.2601: (2012)
26		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
25		Elizabeth Beer, James Allen Fill, Svante Janson, Edward R. Scheinerman: On Vertex, Edge, and Vertex-Edge Random Graphs. Electr. J. Comb. 18(1): (2011)
	2010
24		James Allen Fill, Takéhiko Nakama: Analysis of the Expected Number of Bit Comparisons Required by Quickselect. Algorithmica 58(3): 730-769 (2010)
	2009
23		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
	2006
22		James Allen Fill, Nevin Kapur, Alois Panholzer: Destruction of Very Simple Trees. Algorithmica 46(3-4): 345-366 (2006)
	2005
21		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
20		James Allen Fill, Svante Janson: The number of bit comparisons used by Quicksort: an average-case analysis. SODA 2004: 300-307
19		James Allen Fill, Nevin Kapur: Limiting distributions for additive functionals on Catalan trees. Theor. Comput. Sci. 326(1-3): 69-102 (2004)
	2003
18		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
17		James Allen Fill, Svante Janson: Quicksort asymptotics. J. Algorithms 44(1): 4-28 (2002)
	2001
16		James Allen Fill, Svante Janson: Approximating the limiting Quicksort distribution. Random Struct. Algorithms 19(3-4): 376-406 (2001)
	2000
15		James Allen Fill, Mark Huber: The Randomness Recycler: A New Technique for Perfect Sampling. FOCS 2000: 503-511
14		James Allen Fill, Svante Janson: Smoothness and decay properties of the limiting Quicksort density function CoRR math.PR/0005235: (2000)
13		James Allen Fill, Svante Janson: A characterization of the set of fixed points of the Quicksort transformation CoRR math.PR/0005236: (2000)
12		Luc Devroye, James Allen Fill, Ralph Neininger: Perfect simulation from the Quicksort limit distribution CoRR math.PR/0005237: (2000)
11		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)
10		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)
	1999
9		Robert P. Dobrow, James Allen Fill: Total Path Length For Random Recursive Trees. Combinatorics, Probability & Computing 8(4): 317-333 (1999)
	1997
8		James Allen Fill: An Interruptible Algorithm for Perfect Sampling via Markov Chains. STOC 1997: 688-695
7		James Allen Fill, Robert P. Dobrow: The Number of m-ary Search Trees on n Keys. Combinatorics, Probability & Computing 6(4): 435-453 (1997)
	1996
6		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)
5		James Allen Fill: On the distribution of binary search trees under the random permutation model. Random Struct. Algorithms 8(1): 1-25 (1996)
4		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)
3		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
2		Persi Diaconis, James Allen Fill, Jim Pitman: Analysis of Top To Random Shuffles. Combinatorics, Probability & Computing 1: 135-155 (1992)
	1989
1		James Allen Fill: The Radon Transform on Zn. SIAM J. Discrete Math. 2(2): 262-283 (1989)

Coauthor Index

1	Elizabeth Beer	[25]
2	Patrick Bindjeme	[30] [31]
3	Julien Clément	[23]
4	Luc Devroye	[12]
5	Persi Diaconis	[2]
6	Robert P. Dobrow	[6] [7] [9] [18]
7	Philippe Flajolet	[23]
8	Lars Holst	[4]
9	Mark Huber	[15]
10	Svante Janson	[13] [14] [16] [17] [20] [25] [26] [29]
11	Nevin Kapur	[19] [21] [22]
12	Motoya Machida	[10]
13	Duncan J. Murdoch	[10]
14	Takéhiko Nakama	[24] [28]
15	Ralph Neininger	[12]
16	Alois Panholzer	[22]
17	Jim Pitman	[2]
18	Jeffrey S. Rosenthal	[10]
19	Edward R. Scheinerman	[11] [25]
20	Karen B. Singer-Cohen	[11]
21	Brigitte Vallée	[23]
22	Mark Daniel Ward	[26]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page