Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Dobrow, Bob - Department of Mathematics and Computer Science, Clarkson University
c Springer (Original version in the Proceedings of FPSAC'00) A Generalized Cover Time
Total path length for random recursive trees
Poisson approximations for functionals of random trees
Rates of convergence for a self-organizing scheme for
Math into LATEX An Introduction to LATEX and AMS-LATEX
Multiway trees of maximum and minimum probability under the
The number of m-ary search trees [short title: Number of m-ary search trees]
THE MOVE-TO-ROOT RULE FOR SELF-ORGANIZING TREES WITH
On the Markov chain for the move-to-root rule for binary search trees
On the distribution of distances in recursive trees
Speeding up the FMMR perfect sampling algorithm: A case study revisited
The move-to-front rule for self-organizing lists
2010Copyright @ Otology & Neurotology, Inc. Unauthorized reproduction of this article is prohibited. Potential Role of Imatinib Mesylate (Gleevec, STI-571)
A Bayesian hierarchical occupancy model for track surveys conducted in a series of linear, spatially