𝔖 Scriptorium
✦   LIBER   ✦
📁

Mathematics and computer science 3: algorithms, trees, combinatorics and probabilities

✍ Scribed by Michael Drmota, Philippe Flajolet, Danièle Gardy, Bernhard Gittenberger

Publisher
Birkhäuser Basel
Year
2004
Tongue
English
Leaves
535
Series
Trends in Mathematics
Edition
1
Category
Library
⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis

This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. It addresses a large public in applied mathematics, discrete mathematics and computer science, including researchers, teachers, graduate students and engineers. They will find here current questions in Computer Science and the related modern and powerful mathematical methods. The range of applications is very wide and goes beyond Computer Science.

✦ Subjects

Математика;Дискретная математика;

📜 SIMILAR VOLUMES

Mathematics and Computer Science: Algori
📁 Mathematics and Computer Science: Algorithms, Trees, Combinatorics and Probabilities
✍ Andras Antos, Luc Devroye (auth.), Danièle Gardy, Abdelkader Mokkadem (eds.) 📂 Library 📅 2000 🏛 Birkhäuser Basel 🌐 English

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

Mathematics and Computer Science II: Alg
📁 Mathematics and Computer Science II: Algorithms, Trees, Combinatorics and Probabilities
✍ Didier Arquès, Anne Micheli (auth.), Brigitte Chauvin, Philippe Flajolet, Danièl 📂 Library 📅 2002 🏛 Birkhäuser Basel 🌐 English

<P>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

Mathematics and Computer Science III: Al
📁 Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities
✍ Sylvie Corteel, Guy Louchard, Robin Pemantle (auth.), Michael Drmota, Philippe F 📂 Library 📅 2004 🏛 Birkhäuser Basel 🌐 English

<P>This book contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the 3rd International Colloquium on Mathematics and Computer Science that will be held in Vienna in September 2004. I

Mathematics and Computer Science III: Al
📁 Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities (Trends in Mathematics)
✍ Michael Drmota (editor), Philippe Flajolet (editor), Danièle Gardy (editor), Ber 📂 Library 📅 2013 🏛 Birkhäuser 🌐 English

<p><span>Mathematics and Computer Science III contains invited and contributed papers on combinatorics, random graphs and networks, algorithms analysis and trees, branching processes, constituting the Proceedings of the Third International Colloquium on Mathematics and Computer Science, held in Vien

Computational Probability: Algorithms an
📁 Computational Probability: Algorithms and Applications in the Mathematical Sciences
✍ John H. Drew, Diane L. Evans, Andrew G. Glen, Lawrence M. Leemis (auth.) 📂 Library 📅 2008 🏛 Springer US 🌐 English

<p><P>Computational probability encompasses data structures and algorithms that have emerged over the past decade that allow researchers and students to focus on a new class of stochastic problems. <STRONG>COMPUTATIONAL PROBABILITY</STRONG> is the first book that examines and presents these computat