{"product_id":"mathematics-and-computer-science-algorithms-trees-combinatorics-and-probabilities-9783764364304","title":"Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities","description":"\u003cp\u003e • Author(s): D. Gardy\u003cbr\u003e • Publisher: Springer\u003cbr\u003e • Publisher Imprint: Birkhauser Basel\u003cbr\u003e • BISAC: Probability \u0026amp; Statistics - General\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003e1 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.\u003c\/p\u003e","brand":"Springer","offers":[{"title":"Hardcover","offer_id":45283973234839,"sku":"9783764364304","price":5819.0,"currency_code":"INR","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0666\/3471\/1191\/files\/9783764364304.webp?v=1769279795","url":"https:\/\/atlanticbooks.com\/products\/mathematics-and-computer-science-algorithms-trees-combinatorics-and-probabilities-9783764364304","provider":"Atlantic Books","version":"1.0","type":"link"}