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

Catalogue Display

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

Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities /
Catalogue Information
Field name Details
Dewey Class 519.2
Title Mathematics and Computer Science ([EBook] :) : Algorithms, Trees, Combinatorics and Probabilities / / edited by Danièle Gardy, Abdelkader Mokkadem.
Added Personal Name Gardy, Danièle editor.
Mokkadem, Abdelkader editor.
Other name(s) SpringerLink (Online service)
Publication Basel : : Birkhäuser Basel : : Imprint: Birkhäuser, , 2000.
Physical Details XI, 341 p. : online resource.
Series Trends in mathematics
ISBN 9783034884051
Contents note 1 Rawa trees -- 2 The height and width of simple trees -- 3 On the node structure of binary search trees -- 4 The saturation level in binary search tree -- 5 Smoothness and decay properties of the limiting quicksort density function -- 6 The number of descendants in simply generated random trees -- 7 An universal predictor based on pattern matching, preliminary results -- 8 A bijective proof of the arborescent form of the multivariable Lagrange’s inversion formula -- 9 Counting paths on the slit plane -- 10 Random generation of words of context-free languages according to the frequencies of letters -- 11 An algebra for generating trees -- 12 A set of well-defined operations on succession rules -- 13 Convergence of a genetic algorithm with finite population -- 14 Complexity issues for a redistribution problem -- 15 On the rate of escape of a mutation-selection algorithm -- 16 Randomized rendezvous -- 17 Computing closed-form stochastic bounds on the stationary distribution of Markov chains -- 18 Effects of reordering and lumping in the analysis of discrete-time SANs -- 19 Large deviations for polling systems -- 20 A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network -- 21 A new proof of Yaglom’s exponential limit law -- 22 The branching measure, Hausdorff and packing measures on the Galion-Watson tree -- 23 Likelihood ratio processes and asymptotic statistics for systems of interacting diffusions with branching and immigration -- 24 Probabilistic Analysis of a Schröder Walk Generation Algorithm -- 25 Gibbs families -- 26 Generating functions with high-order poles are nearly polynomial -- 27 Ultrahigh Moments for a Brownian Excursion -- 28 A zero-one law for random sentences in description logics.
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-8405-1
Links to Related Works
Subject References:
Authors:
Corporate Authors:
Series:
Classification:
Catalogue Information 44517 Beginning of record . Catalogue Information 44517 Top of page .

Reviews


This item has not been rated.    Add a Review and/or Rating44517
Quick Search