𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

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


Book ID
127425179
Publisher
Birkhäuser Basel
Year
2004
Tongue
English
Weight
5 MB
Series
Trends in Mathematics
Edition
1
Category
Library
ISBN-13
9783764371289

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


Computational Probability: Algorithms an
✍ John H. Drew, Diane L. Evans, Andrew G. Glen, Lawrence M. Leemis 📂 Library 📅 2007 🏛 Springer 🌐 English ⚖ 2 MB

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. COMPUTATIONAL PROBABILITY is the first book that examines and presents these computational methods in a syst

[Lecture Notes in Computer Science] Comp
✍ Jiang, Tao; Lee, D. T. 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 608 KB

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on