Flajolet philippe (29 Ergebnisse)

Hardcover. Zustand: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less.

Hardcover. Zustand: Good. No Dust Jacket. First Edition; First Printing. 6.75 X 1.5 X 9.75 inches; 492 pages; highlighting on a few pages. Graphs and illustrations. Previous owner's name on front free endpaper. Minor, faint smudges on the exterior edges of textblock. Good condition otherwise. No other noteworthy defects.; - Your satisfaction is our priority. We offer free returns and respond promptly to all inquiries. Your item will be packaged with care and ship on the same or next business day. Buy with confidence.…

Zustand: Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Hardback. Zustand: Fair. Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study. …

Hardcover. Zustand: Brand New. 1st edition. 512 pages. 9.75x6.75x1.50 inches. In Stock.

Zustand: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Hardcover. Zustand: Brand New. 2nd edition. 604 pages. 9.38x1.38x7.75 inches. In Stock.

Zustand: New. In English.

Zustand: New. In English.

Zustand: Used. pp. 576 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.

Gebunden. Zustand: New. Despite growing interest, basic information on methods and models for mathematically analyzing algorithms has rarely been directly accessible to practitioners, researchers, or students. An Introduction to the Analysis of Algorithms, Second Edition, organize.

Zustand: New. In English.

Zustand: New. In English.

Zustand: New. In English.

Zustand: Used. pp. 576.

Zustand: New. This is the second volume in a series of innovative proceedings entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in compute.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This is the second volume in a series of innovative proceedings entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep and innovative mathematical approaches. The book serves as an outstanding tool and a main information source for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and the related modern and powerful mathematical methods. The range of applications is very wide and reaches beyond computer science.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - n-Colored Maps and Multilabel n-Colored Trees.- Limit Laws for Basic Parameters of Lattice Paths with Unbounded Jumps.- Counting Walks in the Quarter Plane.- Bijective Construction of Equivalent Eco-systems.- Random Boundary of a Planar Map.- Enumération des 2-arbres k-gonaux.- Breadth First Search, Triangle-Free Graphs and Brownian Motion.- Random Planar Lattices and Integrated SuperBrownian Excursion.- The Diameter of a Long-Range Percolation Graph.- Giant Components for Two Expanding Graph Processes.- Coloring Random Graphs - an Algorithmic Perspective.- A Sharp Threshold for a Non-monotone Digraph Property.- Approximability of Paths Coloring Problem in Mesh and Torus Networks.- Minimal Spanning Trees for Graphs with Random Edge Lengths.- Generalized Pattern Matching Statistics.- A Note on Random Suffix Search Trees.- On the Profile of Random Forests.- On the Number of Heaps and the Cost of Heap Construction.- A Combinatorial Problem Arising in Information Theory: Precise Minimax Redundancy for Markov Sources.- Analysis of Quickfind with Small Subfiles.- Distribution of the Size of Simplified or Reduced Trees.- Digits and Beyond.- Growth Rate and Ergodicity Conditions for a Class of Random Trees.- Ideals in a Forest, One-Way Infinite Binary Trees and the Contraction Method.- On Random Walks in Random Environment on Trees and Their Relationship with Multiplicative Chaos.- Note on Exact and Asymptotic Distributions of the Parameters of the Loop-Erased Random Walk on the Complete Graph.- Convergence Rate for Stable Weighted Branching Processes.- Reduced Branching Processes in Random Environment.- A Cooperative Approach to Rényi's Parking Problem on the Circle.- On the Noise Sensitivity of Monotone Functions.- Apprentissage de Séquences Non-Indépendantesd'Exemples.- Entropy Reduction Strategies on Tree Structured Retrieval Spaces.- Zero-One Law Characterizations of 0.- Further Applications of Chebyshev Polynomials in the Derivation of Spanning Tree Formulas for Circulant Graphs.- Key words.- List of Authors.…

Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.…

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers.…

Taschenbuch. Zustand: Neu. Mathematics and Computer Science II | Algorithms, Trees, Combinatorics and Probabilities | Brigitte Chauvin (u. a.) | Taschenbuch | xiii | Englisch | 2012 | Birkhäuser | EAN 9783034894753 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Buch. Zustand: Neu. Mathematics and Computer Science II | Algorithms, Trees, Combinatorics and Probabilities | Brigitte Chauvin (u. a.) | Buch | Trends in Mathematics | xiii | Englisch | 2002 | Birkhäuser | EAN 9783764369330 | Verantwortliche Person für die EU: De Gruyter GmbH, Genthiner Str. 13, 10785 Berlin, productsafety[at]degruyterbrill[dot]com | Anbieter: preigu. …

Zustand: New. The International Colloquium on Mathematics and Computer Science is a biennial event that first took place at the University of Versailles-St-Quentin in 2000 and was acknowledged a success. The second colloquium was held in September 16-19, 2002, again in Versailles. This book gathers the second colloquium proceedings. Editor(s): Chauvin, B.; Flajolet, Philippe; Gardy, Daniele; Mokkadem, A. Series: Trends in Mathematics. Num Pages: 543 pages, biography. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Dimension: 234 x 156 x 31. Weight in Grams: 2120. . 2002. Hardback. . . . . Books ship from the US and Ireland.…

Paperback. Zustand: Brand New. 576 pages. 9.25x6.10x1.30 inches. In Stock.

Zustand: New. Editor(s): Drmota, Michael; Flajolet, Philippe; Gardy, Daniele; Gittenberger, Bernhard. Series: Trends in Mathematics. Num Pages: 556 pages, 26 black & white illustrations, biography. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 234 x 156 x 31. Weight in Grams: 978. . 2004. Hardback. . . . . Books ship from the US and Ireland.…

Hardcover. Zustand: Brand New. 1st edition. 810 pages. 9.75x7.00x1.75 inches. In Stock.

Zustand: New. The definitive treatment of analytic combinatorics, from leaders in the field. Exercises, examples, appendices and notes aid understanding. Num Pages: 826 pages, 74 b/w illus. 50 tables. BIC Classification: PBT; PBV. Category: (P) Professional & Vocational. Dimension: 251 x 177 x 47. Weight in Grams: 1562. . 2009. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland. …