Mathematics and Computer Science III
Algorithms, Trees, Combinatorics and Probabilities
Our rough guess is there are 138,500 words in this book.
At a pace averaging 250 words per minute, this book will take 9 hours and 14 minutes to read. With a half hour per day, this will take 19 days to read.
How long will it take you?
This book will take an estimated to read at a reading speed averaging words per minute. With 30 minutes per day, this will take to read.
Enter your reading speedYou can take one of our WPM reading speed tests to find your reading speed.
Create a free account to track your reading progress, build your reading list, and set reading goals.
Author
Contributions
- Flajolet, Philippe - Contributor
- Gardy, Danièle - Contributor
- Gittenberger, Bernhard - Contributor
Publication
2004 - Birkhäuser Basel, Basel, Switzerland
Language
English
Word Count
138,500 words, Guess
Page Count
554 pages
Physical Format
[electronic resource] :
Identifiers
- Open LibraryOL27073366M
- ISBN-139783034879156
- ISBN-103034879156
- OCLC Control Number840290274
- OCLC Control Numbermathematicscompu00cort
Classifications
- LCCQA75.5-76.95
Description
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
Series Statement
- Trends in Mathematics
Links
Other Editions
- Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and Probabilities
Reader Reviews
No reviews yet for this book.
Be the first to share your thoughts!