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

Description

The International Colloquium on Mathematics and Computer Science is a biennial event that first took place at the University of Versailles-St-Quentin in 2000 and was acknowledged a success. The second colloquium was held in September 16-19, 2002, again in Versailles; its proceedings are gathered in this book. The importance of these regular meetings between researchers from mathematics and from computer science is now unanimously recognized by the two communities. The colloquium offers the opportunity to establish the state of the art and to present new trends, new ideas and new results in the common areas such as analysis of algorithms, trees, combinatorics, optimization, performance evaluation and probabilities. This series of proceedings is the first one entirely devoted to the connections between mathematics and computer science. Here mathematics and computer science are directly confronted and joined to tackle intricate problems in computer science with deep and innovative mathematical approaches. The book serves as an outstanding tool and a main information source 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 the related modern and powerful mathematical methods. The range of applications is very wide and reaches beyond computer science.