Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 145,63
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer Verlag GmbH, Vienna, 2010
ISBN 10: 3211999140 ISBN 13: 9783211999141
Librería: Grand Eagle Retail, Bensenville, IL, Estados Unidos de America
Original o primera edición
EUR 147,91
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level.It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy. The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
EUR 144,49
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New.
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 149,79
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level. It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy.
Librería: Mispah books, Redhill, SURRE, Reino Unido
EUR 220,37
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: Like New. Like New. book.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 251,33
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Idioma: Inglés
Publicado por Springer Verlag GmbH, Vienna, 2010
ISBN 10: 3211999140 ISBN 13: 9783211999141
Librería: AussieBookSeller, Truganina, VIC, Australia
Original o primera edición
EUR 280,86
Cantidad disponible: 1 disponibles
Añadir al carritoPaperback. Condición: new. Paperback. Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di?erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level.It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy. The aim of this book is to provide a thorough introduction to various aspects of trees in random settings and a systematic treatment of the mathematical analysis techniques involved. It should serve as a reference book as well as a basis for future research. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
Idioma: Inglés
Publicado por Springer Vienna Okt 2010, 2010
ISBN 10: 3211999140 ISBN 13: 9783211999141
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 149,79
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level. It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy. 476 pp. Englisch.
Librería: moluna, Greven, Alemania
EUR 127,40
Cantidad disponible: Más de 20 disponibles
Añadir al carritoKartoniert / Broschiert. Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Reference Book for asymptotic tree statisticsFoundations for the analysis of recursive algorithmsResearch monograph on the interplay between combinatorics and probability theoryClasses of Random Trees.- Generating Functions.- Advanc.
Librería: preigu, Osnabrück, Alemania
EUR 132,10
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Random Trees | An Interplay between Combinatorics and Probability | Michael Drmota | Taschenbuch | xvii | Englisch | 2010 | Springer | EAN 9783211999141 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand.
Idioma: Inglés
Publicado por Springer Vienna, Springer Vienna Okt 2010, 2010
ISBN 10: 3211999140 ISBN 13: 9783211999141
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 149,79
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Trees are a fundamental object in graph theory and combinatorics as well as a basic object for data structures and algorithms in computer science. During thelastyearsresearchrelatedto(random)treeshasbeenconstantlyincreasing and several asymptotic and probabilistic techniques have been developed in order to describe characteristics of interest of large trees in di erent settings. Thepurposeofthisbookistoprovideathoroughintroductionintovarious aspects of trees in randomsettings anda systematic treatment ofthe involved mathematicaltechniques. It shouldserveasa referencebookaswellasa basis for future research. One major conceptual aspect is to connect combinatorial and probabilistic methods that range from counting techniques (generating functions, bijections) over asymptotic methods (singularity analysis, saddle point techniques) to various sophisticated techniques in asymptotic probab- ity (convergence of stochastic processes, martingales). However, the reading of the book requires just basic knowledge in combinatorics, complex analysis, functional analysis and probability theory of master degree level. It is also part of concept of the book to provide full proofs of the major results even if they are technically involved and lengthy.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 476 pp. Englisch.