ENGLISH

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

By Danièle Gardy , Luc Devroye (auth.) , Abdelkader Mokkadem (eds.) , Andras Antos

Book information

Publisher
Birkhäuser Basel
Year
2000
ISBN
978-3-0348-9553-8, 978-3-0348-8405-1
DOI
10.1007/978-3-0348-8405-1
Language
english
Format
PDF
Filesize
13 MB (13453531 bytes)
Series
Trends in Mathematics
Edition
1
Pages
341\336
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
generalMathematics

Description

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.

Similar books