Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities: Trends in Mathematics
Editat de Daniele Gardy, Abdelkader Mokkademen Limba Engleză Paperback – 29 oct 2012
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 630.46 lei 43-57 zile | |
Birkhäuser Basel – 29 oct 2012 | 630.46 lei 43-57 zile | |
Hardback (1) | 575.96 lei 43-57 zile | |
Birkhauser Basel – 31 aug 2000 | 575.96 lei 43-57 zile |
Din seria Trends in Mathematics
- 18% Preț: 938.22 lei
- 15% Preț: 633.54 lei
- 18% Preț: 780.49 lei
- Preț: 335.58 lei
- 15% Preț: 638.66 lei
- 18% Preț: 921.98 lei
- Preț: 380.92 lei
- 20% Preț: 565.64 lei
- Preț: 385.25 lei
- 15% Preț: 632.73 lei
- Preț: 382.41 lei
- 15% Preț: 580.44 lei
- 15% Preț: 575.96 lei
- 15% Preț: 583.51 lei
- 18% Preț: 933.40 lei
- 24% Preț: 806.73 lei
- 15% Preț: 581.11 lei
- Preț: 373.35 lei
- 18% Preț: 720.34 lei
- Preț: 385.44 lei
- Preț: 387.31 lei
- Preț: 381.87 lei
- 15% Preț: 646.68 lei
- 15% Preț: 642.34 lei
- 18% Preț: 939.13 lei
- 20% Preț: 583.92 lei
- 24% Preț: 802.97 lei
- 15% Preț: 634.18 lei
- 20% Preț: 585.05 lei
- 18% Preț: 948.58 lei
- 15% Preț: 647.63 lei
- 15% Preț: 633.36 lei
- 18% Preț: 938.66 lei
- Preț: 388.44 lei
- Preț: 397.87 lei
- 15% Preț: 635.95 lei
- 15% Preț: 637.21 lei
- 18% Preț: 937.43 lei
- 15% Preț: 575.32 lei
- 15% Preț: 627.29 lei
- Preț: 378.26 lei
- 15% Preț: 628.89 lei
- Preț: 381.11 lei
- 15% Preț: 638.82 lei
- 18% Preț: 930.17 lei
- 18% Preț: 986.94 lei
- 15% Preț: 632.42 lei
- 18% Preț: 940.66 lei
Preț: 630.46 lei
Preț vechi: 741.72 lei
-15% Nou
Puncte Express: 946
Preț estimativ în valută:
120.66€ • 125.33$ • 100.22£
120.66€ • 125.33$ • 100.22£
Carte tipărită la comandă
Livrare economică 03-17 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783034895538
ISBN-10: 3034895534
Pagini: 360
Ilustrații: XI, 341 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:Softcover reprint of the original 1st ed. 2000
Editura: Birkhäuser Basel
Colecția Birkhäuser
Seria Trends in Mathematics
Locul publicării:Basel, Switzerland
ISBN-10: 3034895534
Pagini: 360
Ilustrații: XI, 341 p.
Dimensiuni: 155 x 235 x 19 mm
Greutate: 0.5 kg
Ediția:Softcover reprint of the original 1st ed. 2000
Editura: Birkhäuser Basel
Colecția Birkhäuser
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.