#### Filter Results:

- Full text PDF available (62)

#### Publication Year

1989

2015

- This year (0)
- Last 5 years (11)
- Last 10 years (27)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- James Allen Fill
- STOC
- 1997

For a large class of examples arising in statistical ph~ics known as attnxtiue spin @ems (e.g., the Ising model), one seeks to sample from a probability distribution T on an enormously large state space, but elementary sampling is ruled out by the infeaaibility of calculating an appropriate normalizing constant. The same difficulty arises in computer… (More)

- Persi Diaconis, James Allen Fill, Jim Pitman
- Combinatorics, Probability & Computing
- 1992

- James Allen Fill, Svante Janson
- ArXiv
- 2000

Using Fourier analysis, we prove that the limiting distribution of the standardized random number of comparisons used by Quicksort to sort an array of n numbers has an everywhere positive and infinitely differentiable density f , and that each derivative f (k) enjoys superpolynomial decay at ±∞. In particular, each f (k) is bounded. Our method is… (More)

- James Allen Fill, Nevin Kapur
- Theor. Comput. Sci.
- 2004

Additive tree functionals represent the cost of many divide-andconquer algorithms. We derive the limiting distribution of the additive functionals induced by toll functions of the form (a) nα when α > 0 and (b) log n (the so-called shape functional) on uniformly distributed binary search trees, sometimes called Catalan trees. The Gaussian law obtained in… (More)

- James Allen Fill
- 2007

A well-known theorem usually attributed to Keilson states that, for an irreducible continuous-time birth-and-death chain on the nonnegative integers and any d, the passage time from state 0 to state d is distributed as a sum of d independent exponential random variables. Until now, no probabilistic proof of the theorem has been known. In this paper we use… (More)

- James Allen Fill
- Random Struct. Algorithms
- 1996

- Robert P. Dobrow, James Allen Fill
- Combinatorics, Probability & Computing
- 1999

Total path length, or search cost, for a rooted tree is defined as the sum of all root-to-node distances. Let Tn be the total path length for a random recursive tree of order n. Mahmoud (1991) showed that Wn := (Tn − E[Tn])/n converges almost surely and in L2 to a nondegenerate limiting random variable W . Here we give recurrence relations for the moments… (More)

- James Allen Fill, Svante Janson
- SODA
- 2004

The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and so count the number of bit comparisons. On the other hand, the standard analyses of many other algorithms (such as Quicksort) are performed in terms of the number of key… (More)

- James Allen Fill
- Theor. Comput. Sci.
- 1996

We study the space requirement of m-ary search trees under the random permutation model when m ≥ 27 is fixed. Chauvin and Pouyanne have shown recently that Xn, the space requirement of an m-ary search tree on n keys, equals μ(n + 1) + 2Re [Λn2 ] + nn Reλ2 , where μ and λ2 are certain constants, Λ is a complex-valued random variable, and n → 0 a.s. and in L… (More)