41 citations · 167 across the 47 of their papers we have counts for
Showing 2004 · math.PRShow all
3 papers · 2 filters
math.PR2004★ 8 cited
Destruction of very simple trees
James Allen Fill, Nevin Kapur, Alois Panholzer
We consider the total cost of cutting down a random rooted tree chosen from a family of so-called very simple trees (which include ordered trees, -ary trees, and Cayley trees);…
math.PR2004
The space requirement of m-ary search trees: distributional asymptotics for m >= 27
James Allen Fill, Nevin Kapur
We study the space requirement of -ary search trees under the random permutation model when is fixed. Chauvin and Pouyanne have shown recently that , the space…
math.PR2004
Percolation, first-passage percolation, and covering times for Richardson's model on the n-cube
James Allen Fill, Robin Pemantle
Percolation with edge-passage probability p and first-passage percolation are studied for the n-cube B_n ={0,1}^n with nearest neighbor edges. For oriented and unoriented percolati…