Persisting randomness in randomly growing discrete structures: graphs and search trees. | 0 | 0.34 | 2015 |
Pruned discrete random samples | 1 | 2.25 | 2013 |
On the subtree size profile of binary search trees | 2 | 0.39 | 2010 |
Gaps in discrete random samples: extended abstract | 0 | 0.34 | 2009 |
On the number of iterations required by Von Neumann addition | 1 | 0.45 | 2001 |
On the median-of-K version of Hoare's selection algorithm | 11 | 0.94 | 1999 |