|
|
|
|
LEADER |
01945nam a22005175i 4500 |
001 |
978-3-211-75357-6 |
003 |
DE-He213 |
005 |
20151204140732.0 |
007 |
cr nn 008mamaa |
008 |
100301s2009 au | s |||| 0|eng d |
020 |
|
|
|a 9783211753576
|9 978-3-211-75357-6
|
024 |
7 |
|
|a 10.1007/978-3-211-75357-6
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a QA150-272
|
072 |
|
7 |
|a PBD
|2 bicssc
|
072 |
|
7 |
|a MAT008000
|2 bisacsh
|
082 |
0 |
4 |
|a 511.1
|2 23
|
100 |
1 |
|
|a Drmota, Michael.
|e author.
|
245 |
1 |
0 |
|a Random Trees
|h [electronic resource] :
|b An Interplay between Combinatorics and Probability /
|c by Michael Drmota.
|
264 |
|
1 |
|a Vienna :
|b Springer Vienna,
|c 2009.
|
300 |
|
|
|a XVII, 458 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
505 |
0 |
|
|a 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.
|
650 |
|
0 |
|a Mathematics.
|
650 |
|
0 |
|a Data structures (Computer science).
|
650 |
|
0 |
|a Algebra.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Probabilities.
|
650 |
|
0 |
|a Discrete mathematics.
|
650 |
|
0 |
|a Combinatorics.
|
650 |
1 |
4 |
|a Mathematics.
|
650 |
2 |
4 |
|a Discrete Mathematics.
|
650 |
2 |
4 |
|a Algebra.
|
650 |
2 |
4 |
|a Probability Theory and Stochastic Processes.
|
650 |
2 |
4 |
|a Combinatorics.
|
650 |
2 |
4 |
|a Algorithms.
|
650 |
2 |
4 |
|a Data Structures.
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783211753552
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1007/978-3-211-75357-6
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SMA
|
950 |
|
|
|a Mathematics and Statistics (Springer-11649)
|