Shortcuts
Please wait while page loads.
SISSA Library . Default .
PageMenu- Main Menu-
Page content

Catalogue Display

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

Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities /
Catalogue Information
Field name Details
Dewey Class 519
Title Mathematics and Computer Science II ([EBook] :) : Algorithms, Trees, Combinatorics and Probabilities / / edited by Brigitte Chauvin, Philippe Flajolet, Danièle Gardy, Abdelkader Mokkadem.
Added Personal Name Chauvin, Brigitte editor.
Flajolet, Philippe editor.
Gardy, Danièle editor.
Mokkadem, Abdelkader editor.
Other name(s) SpringerLink (Online service)
Publication Basel : : Birkhäuser Basel : : Imprint: Birkhäuser, , 2002.
Physical Details XIII, 543 p. : online resource.
Series Trends in mathematics
ISBN 9783034882118
Contents note 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épendantes d’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.
System details note Online access to this digital book is restricted to subscription institutions through IP address (only for SISSA internal users)
Internet Site http://dx.doi.org/10.1007/978-3-0348-8211-8
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 46631 Beginning of record . Catalogue Information 46631 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating46631
. E-mail This Page
Quick Search