<E-Book>
Mathematics and Computer Science : Algorithms, Trees, Combinatorics and Probabilities / edited by Daniele Gardy, Abdelkader Mokkadem
(Trends in Mathematics. ISSN:2297024X)
Edition | 1st ed. 2000. |
---|---|
Publisher | Basel : Birkhäuser Basel : Imprint: Birkhäuser |
Year | 2000 |
Language | English |
Size | XI, 341 p : online resource |
Authors | Gardy, Daniele editor Mokkadem, Abdelkader editor SpringerLink (Online service) |
Subjects | LCSH:Probabilities LCSH:Mathematics FREE:Probability Theory FREE:Mathematics |
Notes | 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 HTTP:URL=https://doi.org/10.1007/978-3-0348-8405-1 |
TOC
Hide book details.
E-Book | Location | Media type | Volume | Call No. | Status | Reserve | Comments | ISBN | Printed | Restriction | Designated Book | Barcode No. |
---|---|---|---|---|---|---|---|---|---|---|---|---|
E-Book | オンライン | 電子ブック |
|
|
Springer eBooks | 9783034884051 |
|
電子リソース |
|
EB00233581 |
Hide details.
Material Type | E-Book |
---|---|
Classification | LCC:QA273.A1-274.9 DC23:519.2 |
ID | 4000107609 |
ISBN | 9783034884051 |
Similar Items
Usage statistics of this contents
Number of accesses to this page:6times
※After Sep 4, 2017