Mathematics and Computer Science - Algorithms, Trees, Combinatorics and Probabilities (Paperback, Softcover reprint of the original 1st ed. 2000)

This book is based on the proceedings of the Colloquium on Mathematics and Computer Science held in the University of Versailles-St-Quentin on September 18- It contains articles on topics that are relevant both to Mathematics and 20, 2000. to Computer Science. These articles have been selected throughout a rigourous process; each of them has been submitted to two referees at least. This selection process, which took place under the supervision of the scientific committee, en- sures the high level and the originality of the contributions. We thank the invited speakers, the authors, the participants to the collo- quium and, of course, the Scientific Committee whose members were D. Aldous, F. Baccelli, P. Cartier, B. Chauvin, P. Flajolet, J.M. Fourneau, D. Gardy, D. Gouyou- Beauchamps, R. Kenyon, J.F. Le Gall, C. Lemarechal, R. Lyons, A. Mokkadem, A. Rouault and C. Roucairol. We also take this opportunity to thank the University of Versailles-St-Quentin, the University of Paris-Sud (Orsay) and the Centre National de la Recherche Sci- entifique (CNRS), whose financial and material support contributed to the success of the Colloquium.

General

Imprint:	Springer Basel
Country of origin:	Switzerland
Series:	Trends in Mathematics
Release date:	October 2012
First published:	October 2012
Editors:	Daniele Gardy • Abdelkader Mokkadem
Dimensions:	235 x 155 x 18mm (L x W x T)
Format:	Paperback
Pages:	341
Edition:	Softcover reprint of the original 1st ed. 2000
ISBN-13:	978-3-03-489553-8
Categories:	Books > Science & Mathematics > Mathematics > Probability & statistics Promotions
LSN:	3-03-489553-4
Barcode:	9783034895538

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!