Cantitate/Preț
Produs

Random Generation of Trees: Random Generators in Computer Science

Autor Laurent Alonso, René Schott
en Limba Engleză Hardback – 31 dec 1994
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 124209 lei  6-8 săpt.
  Springer Us – 7 dec 2010 124209 lei  6-8 săpt.
Hardback (1) 124839 lei  6-8 săpt.
  Springer Us – 31 dec 1994 124839 lei  6-8 săpt.

Preț: 124839 lei

Preț vechi: 156049 lei
-20% Nou

Puncte Express: 1873

Preț estimativ în valută:
23899 24842$ 19815£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9780792395287
ISBN-10: 079239528X
Pagini: 208
Ilustrații: XII, 208 p.
Dimensiuni: 155 x 235 x 14 mm
Greutate: 0.49 kg
Ediția:1995
Editura: Springer Us
Colecția Springer
Locul publicării:New York, NY, United States

Public țintă

Research

Cuprins

1 Introduction.- 2 Notations.- 3 Generation of Simple Kinds of Trees.- 4 Generation Using Bijective Methods.- 5 Generation of Forests of Trees Split into Patterns.- 6 Generation of Colored Trees.- 7 Two Methods of Generation by Rejection.- 8 Arborescences.- 9 Generation of Trees with a Given Height and Some Tricks about Complexity.- 10 A Parallel Algorithm for the Generation of Words.- Appendix 1 Horton-Strahler’s Numbers.- Appendix 2 Algorithms.- 2.1 Generation of binary trees: Rimy’s algorithm.- 2.2 Generation of unary-binary trees: Samaj Lareida’s algorithm.- Appendix 3 Pictures of Trees.- References.