Borrow it
 African Studies Library
 Alumni Medical Library
 Astronomy Library
 Fineman and Pappas Law Libraries
 Frederick S. Pardee Management Library
 Howard Gotlieb Archival Research Center
 Mugar Memorial Library
 Music Library
 Pikering Educational Resources Library
 School of Theology Library
 Science & Engineering Library
 Stone Science Library
The Resource Random trees : an interplay between combinatorics and probability, Michael Drmota
Random trees : an interplay between combinatorics and probability, Michael Drmota
Resource Information
The item Random trees : an interplay between combinatorics and probability, Michael Drmota represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.This item is available to borrow from all library branches.
Resource Information
The item Random trees : an interplay between combinatorics and probability, Michael Drmota represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in Boston University Libraries.
This item is available to borrow from all library branches.
 Summary
 Out of research related to (random) trees, several asymptotic and probabilistic techniques have been developed to describe characteristics of large trees in different settings. The aim here is to provide an introduction to various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques
 Language
 eng
 Extent
 xvii, 458 pages
 Contents

 Classes of random trees
 Generating functions
 Advanced tree counting
 The shape of GaltonWatson trees and Polya trees
 The vertical profile of trees
 Recursive treesand binary search trees
 Tries and digital search trees
 Recursive algorithms and the contraction method
 Planar graphs
 Isbn
 9783211753552
 Label
 Random trees : an interplay between combinatorics and probability
 Title
 Random trees
 Title remainder
 an interplay between combinatorics and probability
 Statement of responsibility
 Michael Drmota
 Language
 eng
 Summary
 Out of research related to (random) trees, several asymptotic and probabilistic techniques have been developed to describe characteristics of large trees in different settings. The aim here is to provide an introduction to various aspects of trees in random settings and a systematic treatment of the involved mathematical techniques
 Action
 committed to retain for EAST
 Cataloging source
 UKM
 http://library.link/vocab/creatorDate
 1957
 http://library.link/vocab/creatorName
 Drmota, Michael
 Illustrations
 illustrations
 Index
 index present
 LC call number
 QA166.2
 LC item number
 .D766 2009
 Literary form
 non fiction
 Nature of contents
 bibliography
 http://library.link/vocab/subjectName

 Trees (Graph theory)
 Stochastic processes
 Stochastic processes
 Trees (Graph theory)
 Baum (Mathematik)
 Zufallsgraph
 Label
 Random trees : an interplay between combinatorics and probability, Michael Drmota
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Classes of random trees  Generating functions  Advanced tree counting  The shape of GaltonWatson trees and Polya trees  The vertical profile of trees  Recursive treesand binary search trees  Tries and digital search trees  Recursive algorithms and the contraction method  Planar graphs
 Dimensions
 24 cm
 Extent
 xvii, 458 pages
 Isbn
 9783211753552
 Isbn Type
 (hbk.)
 Lccn
 2008942098
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number

 (OCoLC)305126814
 (OCoLC)ocn305126814
 Label
 Random trees : an interplay between combinatorics and probability, Michael Drmota
 Bibliography note
 Includes bibliographical references and index
 Carrier category
 volume
 Carrier category code

 nc
 Carrier MARC source
 rdacarrier
 Content category
 text
 Content type code

 txt
 Content type MARC source
 rdacontent
 Contents
 Classes of random trees  Generating functions  Advanced tree counting  The shape of GaltonWatson trees and Polya trees  The vertical profile of trees  Recursive treesand binary search trees  Tries and digital search trees  Recursive algorithms and the contraction method  Planar graphs
 Dimensions
 24 cm
 Extent
 xvii, 458 pages
 Isbn
 9783211753552
 Isbn Type
 (hbk.)
 Lccn
 2008942098
 Media category
 unmediated
 Media MARC source
 rdamedia
 Media type code

 n
 Other physical details
 illustrations
 System control number

 (OCoLC)305126814
 (OCoLC)ocn305126814
Library Locations

African Studies LibraryBorrow it771 Commonwealth Avenue, 6th Floor, Boston, MA, 02215, US42.350723 71.108227


Astronomy LibraryBorrow it725 Commonwealth Avenue, 6th Floor, Boston, MA, 02445, US42.350259 71.105717

Fineman and Pappas Law LibrariesBorrow it765 Commonwealth Avenue, Boston, MA, 02215, US42.350979 71.107023

Frederick S. Pardee Management LibraryBorrow it595 Commonwealth Avenue, Boston, MA, 02215, US42.349626 71.099547

Howard Gotlieb Archival Research CenterBorrow it771 Commonwealth Avenue, 5th Floor, Boston, MA, 02215, US42.350723 71.108227


Music LibraryBorrow it771 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350723 71.108227

Pikering Educational Resources LibraryBorrow it2 Silber Way, Boston, MA, 02215, US42.349804 71.101425

School of Theology LibraryBorrow it745 Commonwealth Avenue, 2nd Floor, Boston, MA, 02215, US42.350494 71.107235

Science & Engineering LibraryBorrow it38 Cummington Mall, Boston, MA, 02215, US42.348472 71.102257

Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Randomtreesaninterplaybetweencombinatorics/ZOLbj7TU2uU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Randomtreesaninterplaybetweencombinatorics/ZOLbj7TU2uU/">Random trees : an interplay between combinatorics and probability, Michael Drmota</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Item Random trees : an interplay between combinatorics and probability, Michael Drmota
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.bu.edu/portal/Randomtreesaninterplaybetweencombinatorics/ZOLbj7TU2uU/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.bu.edu/portal/Randomtreesaninterplaybetweencombinatorics/ZOLbj7TU2uU/">Random trees : an interplay between combinatorics and probability, Michael Drmota</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.bu.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.bu.edu/">Boston University Libraries</a></span></span></span></span></div>