Random Generators in Computer Science
Edición de la obra Random Generation of Trees
| Autor | Laurent Alonso |
|---|---|
| Editorial | Springer US |
| Fecha de publicación | 1995 |
| Lugar | Boston, MA |
| Idioma | inglés |
| Páginas | 220 |
| Formato | [electronic resource] : |
| ISBN-13 | 9781441951502, 9781475763539 |
| ISBN-10 | 1441951504, 1475763530 |
| OCLC | 851795199 |
| Número de Cutter | A454r |
Random Generation of Trees is about a field on the crossroads between computer science, combinatorics and probability theory. Computer scientists need random generators for performance analysis, simulation, image synthesis, etc. In this context random generation of trees is of particular interest. The algorithms presented here are efficient and easy to code. Some aspects of Horton--Strahler numbers, programs written in C and pictures are presented in the appendices. The complexity analysis is done rigorously both in the worst and average cases. Random Generation of Trees is intended for students in computer science and applied mathematics as well as researchers interested in random generation.