Mathematics and Computer Science II
Editat de Brigitte Chauvin, Philippe Flajolet, Daniele Gardy, Abdelkader Mokkademen Limba Engleză Hardback – aug 2002
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 628.24 lei 43-57 zile | |
| Birkhäuser Basel – 31 oct 2012 | 628.24 lei 43-57 zile | |
| Hardback (1) | 632.37 lei 43-57 zile | |
| birkhäuser – aug 2002 | 632.37 lei 43-57 zile |
Preț: 632.37 lei
Preț vechi: 743.97 lei
-15%
Puncte Express: 949
Preț estimativ în valută:
111.82€ • 128.23$ • 96.64£
111.82€ • 128.23$ • 96.64£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783764369330
ISBN-10: 3764369337
Pagini: 564
Ilustrații: XIII, 543 p.
Dimensiuni: 160 x 241 x 34 mm
Greutate: 1 kg
Ediția:2002
Editura: birkhäuser
Locul publicării:Basel, Switzerland
ISBN-10: 3764369337
Pagini: 564
Ilustrații: XIII, 543 p.
Dimensiuni: 160 x 241 x 34 mm
Greutate: 1 kg
Ediția:2002
Editura: birkhäuser
Locul publicării:Basel, Switzerland
Public țintă
ResearchCuprins
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.