Mathematics and Computer Science [electronic resource] : Algorithms, Trees, Combinatorics and Probabilities / edited by Danièle Gardy, Abdelkader Mokkadem.

9783034884051

Basel : Birkhäuser Basel, 2000.

1 online resource.

Access is available to the Yale community.

Access restricted by licensing agreement.

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.

Springer ebooks.

Printed edition:

Books / Online

English

February 05, 2013