Bild 1 von 1

Ähnlichen Artikel verkaufen?

Selbst verkaufen

Mathematik und Informatik II: Algorithmen, Bäume, Kombinatorik und Probab

grandeagleretail

(927807)

US $126,75

Ca.CHF 107,46

Artikelzustand:

Neu

Stückzahl:

3 verfügbar

Versand:

Kostenlos Economy Shipping.

Standort: Fairfield, Ohio, USA

Lieferung:

Lieferung zwischen Di, 8. Okt und Di, 15. Okt nach 43230 bei heutigem Zahlungseingang

Rücknahme:

30 Tage Rückgabe. Käufer zahlt Rückversand.

Zahlungen:

Sicher einkaufen

eBay-Käuferschutz

Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. Mehr erfahreneBay-Käuferschutz - wird in neuem Fenster oder Tab geöffnet

Artikel melden - wird in neuem Fenster oder Tab geöffnet

Der Verkäufer ist für dieses Angebot verantwortlich.

eBay-Artikelnr.:386666243501

Zuletzt aktualisiert am 22. Sep. 2024 11:51:51 MESZAlle Änderungen ansehenAlle Änderungen ansehen

Artikelmerkmale

Artikelzustand: Neu: Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte ...

ISBN-13: 9783764369330

Book Title: Mathematics and Computer Science II

ISBN: 9783764369330

Subject Area: Mathematics, Computers

Publication Name: Mathematics and Computer Science II : Algorithms, Trees, Combinatorics and Probabilities

Publisher: Springer Basel A&G

Item Length: 9.3 in

Subject: Computer Science, Graphic Methods, Combinatorics, Databases / General, Applied, Discrete Mathematics

Publication Year: 2002

Series: Trends in Mathematics Ser.

Type: Textbook

Format: Hardcover

Language: English

Author: Philippe Flajolet

Item Weight: 74.8 Oz

Item Width: 6.1 in

Number of Pages: Xiii, 543 Pages

Über dieses Produkt

Product Identifiers

Publisher

Springer Basel A&G

ISBN-10

3764369337

ISBN-13

9783764369330

eBay Product ID (ePID)

2265621

Product Key Features

Number of Pages

Xiii, 543 Pages

Language

English

Publication Name

Mathematics and Computer Science II : Algorithms, Trees, Combinatorics and Probabilities

Publication Year

2002

Subject

Computer Science, Graphic Methods, Combinatorics, Databases / General, Applied, Discrete Mathematics

Type

Textbook

Subject Area

Mathematics, Computers

Author

Philippe Flajolet

Series

Trends in Mathematics Ser.

Format

Hardcover

Dimensions

Item Weight

74.8 Oz

Item Length

9.3 in

Item Width

6.1 in

Additional Product Features

Intended Audience

Scholarly & Professional

LCCN

2002-027905

Dewey Edition

Number of Volumes

1 vol.

Illustrated

Yes

Dewey Decimal

511

Table Of Content

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.

Synopsis

These are the Proceedings of the International Colloquium of Mathematics and Computer Science held at the University of Versailles-St-Quentin, September 18-20,2002. This colloquium is the second one in a now regularly established series the first venue in September 2000 in Versailles. The present issue is cen following tered around Combinatorics, Random Graphs and Networks, Algorithms Analysis and Trees, Branching Processes and Trees, Applied Random Combinatorics. The contributions have been carefully reviewed for their scientific quality and originality by the Scientific Committee chaired by P. Flajolet and composed by P. Chassaing, B. Chauvin, M. Drmota, J. Fill, P. Flajolet, A. Frieze, D. Gardy, S. Janson, C. Krattenthaler, G. Louchard, A. Mokkadem, R. Pemantle, P. Robert, J. Spencer, B. Ycart. We do thank them for their impressive work. We also thank the invited speakers: D. Aldous, L. Devroye, S. Janson, M. Krivelevich, B. Pittel, H. Prodinger, M. Steele, the authors of submitted papers and the participants for their contribution to the success of the conference. A. Baffert and C. Ducoin deserve special thanks for their kind and efficient contribution to the material preparation of the colloquium. Finally, we express our acknowledgements to the laboratory of Mathemat ics (LAMA), the laboratory of Computer Science (PRISM), the University of Versailles-St-Quentin, the Centre National de la Recherche Scientifique (CNRS) and the Institut National de Recherche en Informatique et Automatique (INRIA) for providing generous financial and material support., 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.

LC Classification Number

T57-57.97