Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities: Trends in Mathematics
Editat de Daniele Gardy, Abdelkader Mokkademen Limba Engleză Hardback – 31 aug 2000
| Toate formatele și edițiile | Preț | Express |
|---|---|---|
| Paperback (1) | 618.64 lei 6-8 săpt. | |
| Birkhäuser Basel – 29 oct 2012 | 618.64 lei 6-8 săpt. | |
| Hardback (1) | 565.19 lei 6-8 săpt. | |
| Birkhauser Basel – 31 aug 2000 | 565.19 lei 6-8 săpt. |
Din seria Trends in Mathematics
- 18%
Preț: 908.31 lei - 18%
Preț: 1329.89 lei - 18%
Preț: 1171.41 lei - 18%
Preț: 920.45 lei - 15%
Preț: 621.67 lei -
Preț: 366.95 lei - 18%
Preț: 919.67 lei -
Preț: 371.37 lei -
Preț: 378.21 lei -
Preț: 378.41 lei - 15%
Preț: 620.55 lei - 15%
Preț: 615.52 lei - 20%
Preț: 633.17 lei - 15%
Preț: 624.01 lei - 15%
Preț: 626.68 lei - 15%
Preț: 615.52 lei - 15%
Preț: 620.86 lei -
Preț: 374.91 lei - 18%
Preț: 706.75 lei - 18%
Preț: 915.73 lei - 20%
Preț: 631.96 lei - 15%
Preț: 626.82 lei - 15%
Preț: 630.29 lei - 18%
Preț: 921.36 lei - 18%
Preț: 912.55 lei - 18%
Preț: 930.60 lei - 15%
Preț: 622.29 lei - 15%
Preț: 635.48 lei - 24%
Preț: 873.14 lei - 15%
Preț: 572.58 lei - 20%
Preț: 612.14 lei -
Preț: 366.56 lei -
Preț: 390.61 lei -
Preț: 375.44 lei - 15%
Preț: 625.26 lei -
Preț: 380.24 lei - 15%
Preț: 617.08 lei - 18%
Preț: 904.53 lei - 18%
Preț: 922.85 lei - 18%
Preț: 968.22 lei - 15%
Preț: 634.54 lei - 24%
Preț: 865.87 lei -
Preț: 381.34 lei - 15%
Preț: 569.59 lei - 18%
Preț: 920.88 lei
Preț: 565.19 lei
Preț vechi: 664.92 lei
-15% Nou
Puncte Express: 848
Preț estimativ în valută:
99.100€ • 117.56$ • 87.58£
99.100€ • 117.56$ • 87.58£
Carte tipărită la comandă
Livrare economică 29 ianuarie-12 februarie 26
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783764364304
ISBN-10: 3764364300
Pagini: 340
Greutate: 0.68 kg
Editura: Birkhauser Basel
Colecția Birkhauser
Seria Trends in Mathematics
Locul publicării:Basel, Switzerland
ISBN-10: 3764364300
Pagini: 340
Greutate: 0.68 kg
Editura: Birkhauser Basel
Colecția Birkhauser
Seria Trends in Mathematics
Locul publicării:Basel, Switzerland
Public țintă
ResearchCuprins
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.