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

Algorithms, Trees, Combinatorics and Probabilities

By: Daniele Gardy (Editor), Abdelkader Mokkadem (Editor)

Write A Review

Hardcover | 1 October 2000

At a Glance

Hardcover
360 Pages

Dimensions(cm)
22.86 x 16.51 x 2.54

Hardcover

$139.00

or 4 interest-free payments of $34.75 with

or

Ships in 5 to 7 business days

This is the first book where mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep mathematical approaches. It contains a collection of refereed papers presented at the Colloquium on Mathematics and Computer Science held at the University of Versailles-St-Quentin on September 18-20, 2000. The colloquium was a meeting place for researchers in mathematics and computer science and thus an important opportunity to exchange ideas and points of view, and to present new approaches and new results in the common areas such as algorithms analysis, trees, combinatorics, optimization, performance evaluation and probabilities. The book is intended for a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. It provides an overview of the current questions in computer science and related modern mathematical methods. The range of applications is very wide and reaches beyond computer science.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $79.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

More in Combinatorics & Graph Theory

Foundations of Graph Theory - Peter Griffin

$158.99

11%
OFF

Discrete Mathematics for Data Science

Paperback

RRP $103.00

$91.75

11%
OFF

The Random Number Code

Unlocking the Secrets of Numbers That You Can't Predict but Can Rely On

Paperback

RRP $56.99

$56.75

The Random Number Code

Unlocking the Secrets of Numbers That You Can't Predict but Can Rely On

Hardcover

RRP $399.00

$341.75

14%
OFF

Monomial Algebras

Chapman & Hall/CRC Monographs and Research Notes in Mathematics

Hardcover

RRP $315.00

$271.99

14%
OFF

Introduction to Modern Cryptography

Chapman & Hall/Crc Cryptography and Network Security

Hardcover

RRP $242.00

$233.75

Mathematics of Tabletop Games

AK Peters/CRC Recreational Mathematics

Paperback

RRP $52.99

$48.99

Introduction to Modern Cryptography : Revised Third Edition - Jonathan Katz

$80.75

Introduction to Spectral Graph Theory : Compact Textbooks in Mathematics - Kiyan Naderi

$63.99

10%
OFF

Milestones in Graph Theory

A Century of Progress

Paperback

RRP $160.00

$154.75

$SEL PROB VIETNAMESE MATH'L..(V5) : Mathematical Olympiad - CHAU LE HAI$

SEL PROB VIETNAMESE MATH'L..(V5)

Mathematical Olympiad

Paperback

RRP $70.99

$63.99

10%
OFF

Combinatorial Problems In Mathematical Competitions

Mathematical Olympiad Series

Paperback

RRP $61.99

$55.99

10%
OFF

COMBINATORIAL EXTREMIZATION

In Mathematical Olympiad And Competitions

Paperback

RRP $45.99

$41.75

Introducing Game Theory and its Applications : Advances in Applied Mathematics - Elliott Mendelson

$73.99

10%
OFF

$The Math Thought Mindset : Logic, Reasoning, and Proofs - James L. Burk$

The Math Thought Mindset

Logic, Reasoning, and Proofs

Paperback

$271.75

$The Math Thought Mindset : Logic, Reasoning, and Proofs - James L. Burk$

Foreword
Preface
Rawa trees	p. 3
The height and width of simple trees	p. 17
On the node structure of binary search trees	p. 31
The saturation level in binary search tree	p. 41
Smoothness and decay properties of the limiting quicksort density function	p. 53
The number of descendants in simply generated random trees	p. 65
An universal predictor based on pattern matching, preliminary results	p. 75
A bijective proof of the arborescent form of the multivariable Lagrange's inversion formula	p. 89
Counting paths on the slit plane	p. 101
Random generation of words of context-free languages according to the frequencies of letters	p. 113
An algebra for generating trees	p. 127
A set of well-defined operations on succession rules	p. 141
Convergence of a genetic algorithm with finite population	p. 155
Complexity issues for a redistribution problem	p. 165
On the Rate of escape of a mutation-selection algorithm	p. 177
Randomized rendezvous	p. 183
Computing closed-form stochastic bounds on the stationary distribution of Markov chains	p. 197
Effects of reordering and lumping in the analysis of discrete-time SANs	p. 209
Large deviations for polling systems	p. 221
A nonlinear integral operator encountered in the bandwidth sharing of a star-shaped network	p. 231
A new proof of Yaglom's exponential limit law	p. 245
The branching measure, Hausdorff and packing measures on the Galton-Watson tree	p. 251
Likelihood ratio processes and asymptotic statistics for systems of interacting diffusions with branching and immigration	p. 265
Probabilistic Analysis of a Schroder Walk Generation Algorithm	p. 275
Gibbs families	p. 295
Generating functions with high-order poles are nearly polynomial	p. 305
Ultrahigh Moments for a Brownian Excursion	p. 323
A zero-one law for random sentences in description logics	p. 329
Table of Contents provided by Blackwell. All Rights Reserved.

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

Algorithms, Trees, Combinatorics and Probabilities

At a Glance

Hardcover

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Combinatorics & Graph Theory

Foundations of Graph Theory