𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Evolution of random search trees

✍ Scribed by Hosam M. Mahmoud


Book ID
127424307
Publisher
Wiley
Year
1992
Tongue
English
Weight
2 MB
Series
Wiley-Interscience series in discrete mathematics and optimization
Edition
1
Category
Library
City
New York
ISBN-13
9780471532286

No coin nor oath required. For personal study only.

✦ Synopsis


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.

✦ Subjects


Компьютерная литература


📜 SIMILAR VOLUMES


Random Hyperplane Search Trees
✍ Devroye, Luc; King, James; McDiarmid, Colin 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 274 KB
Randomized search trees
✍ R. Seidel and C. R. Aragon 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 857 KB
Randomized Search Trees
✍ Aragon, R. Seidel, C.R. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 411 KB
Randomized binary search trees
✍ Martínez, Conrado; Roura, Salvador 📂 Article 📅 1998 🏛 Association for Computing Machinery 🌐 English ⚖ 314 KB