While several excellent books have been written on algorithms and their analysis, remarkably few have been dedicated to the probabilistic analysis of algorithms. This graduate text/professional reference fills that gap and brings together material that is scattered over tens of publications. Its unifying theme is the study of some classes of random search trees suitable for use as data structures with a behavior of random growth that is almost as good as balanced trees.

Скачать книгу бесплатно (djvu, 2.46 Mb)

---

Читать «Evolution of random search trees»