Random Trees: An Interplay between Combinatorics and Probability
Autor Michael Drmotaen Limba Engleză Hardback – 22 dec 2008
Preț: 881.00 lei
Preț vechi: 1074.38 lei
-18%
Puncte Express: 1322
Carte tipărită la comandă
Livrare economică 13-27 iunie
Specificații
ISBN-13: 9783211753552
ISBN-10: 3211753559
Pagini: 478
Ilustrații: XVII, 458 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.18 kg
Ediția:2009
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
ISBN-10: 3211753559
Pagini: 478
Ilustrații: XVII, 458 p.
Dimensiuni: 155 x 235 x 32 mm
Greutate: 1.18 kg
Ediția:2009
Editura: SPRINGER VIENNA
Colecția Springer
Locul publicării:Vienna, Austria
V-ar putea interesa
-
LatticeDeepayan Sarkar-15%Preț: 559.45 lei658.17 lei -
Exploring Abstract Algebra With Mathematica®Allen C. HibbardPreț: 388.57 lei -
Engineering OptimizationXin She Yang-9%Preț: 897.21 lei985.95 lei -
Evolutionary Optimization AlgorithmsDan Simon-9%Preț: 794.73 lei873.33 lei -
Topics in Structural Graph TheoryLowell W. Beineke-23%Preț: 831.32 lei1079.64 lei -
Theory of ComputationGeorge Tourlakis-9%Preț: 800.51 lei879.69 lei -
Introduction to CombinatoricsMartin J. Erickson-11%Preț: 659.63 lei741.16 lei -
-8%Preț: 619.94 lei673.85 lei -
An Engineer′s Guide to Mathematica®EB Magrab-23%Preț: 605.13 lei785.88 lei -
Cooperation: Game-Theoretic ApproachesSergiu Hart-20%Preț: 622.90 lei778.62 lei -
Das verrückte Mathe-Comic-BuchGert HöfnerPreț: 335.46 lei
Public țintă
ResearchCuprins
Classes of Random Trees.- Generating Functions.- Advanced Tree Counting.- The Shape of Galton-Watson Trees and Pólya Trees.- The Vertical Profile of Trees.- Recursive Trees and Binary Search Trees.- Tries and Digital Search Trees.- Recursive Algorithms and the Contraction Method.- Planar Graphs.
Caracteristici
Reference Book for asymptotic tree statistics Foundations for the analysis of recursive algorithms Research monograph on the interplay between combinatorics and probability theory Includes supplementary material: sn.pub/extras