Kategorien
Mein Mercateo
Anmelden / Registrieren
Warenkorb
 
 

Mathematics and Computer Science II


Menge:  Stück  
Produktinformationen
cover
cover
Artikel-Nr.:
     5667A-9783034894753
Hersteller:
     Springer Basel
Herst.-Nr.:
     9783034894753
EAN/GTIN:
     9783034894753
Suchbegriffe:
Mathematik-Bücher
Mathematikbücher - englischsprachig
mathematikbücher - englischsprachig
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.
Weitere Informationen:
Author:
Brigitte Chauvin; Philippe Flajolet; Daniele Gardy; Abdelkader Mokkadem
Verlag:
Springer Basel
Sprache:
eng
Weitere Suchbegriffe: coding; Control and Optimization; graph theory; Optimization; Probability theory; Statistics, algorithms, coding, combinatorics, computer, computer science, control and optimization, graph theory, optimization, probability theory, statistics
Die Konditionen im Überblick1
Lieferzeit
Lagerstand
Preis
€ 99,99*
Konditionen selbst auswählen
Artikel empfehlenArtikel merken
* Preise mit Sternchen sind Nettopreise zzgl. gesetzlich gültiger MwSt.
UVP bedeutet „Unverbindliche Preisempfehlung“
Unser Angebot richtet sich ausschließlich an Unternehmen, Gewerbetreibende und Freiberufler.