Probability and Computing: Randomized Algorithms and...

Features

• Cover Type: Hard Cover with 368 pages
• Published by: Cambridge University Press January 31, 2005
• Written in: English
• ISBN 10 Number: 0521835402
• ISBN 13 Number: 978-0521835404
• Book Dimensions: 10.2 x 7 x 1 inches
• Weighs: 1.8 pounds

Product Review
"An great book which sets off straight away in Chapter 1 with interesting motivational examples, striking the right balance between theory and application. Having both breadth and depth it is accessible and interesting to both undergraduate and graduate students. It takes the reader all the way from introductory to advanced topics and leaves them empowered with the tools to continue research on their ownIt's obviously written by people who understand the subject inside out and how to explain it to students. Buy it, read it enjoy it; profit from it. It feels as if it has been well tested out on students and will work straight away." Colin Cooper, King's College, University of London

"An exciting new book on randomized algorithms. It nicely covers all the basics, and also has some interesting modern applications for the more advanced student." Alan Frieze, Carnegie-Mellon University

"This text provides a solid background in probabilistic techniques, illustrating each with well-chosen examples. The explanations are clear, and convey the intuition behind the results and techniques, yet the coverage is rigorous. An great advanced undergraduate text." Peter Bartlett, University of California, Berkeley

"Probability is part of the conceptual core of modern computer science. Probabilistic analysis of algorithms, randomized algorithms and probabilistic combinatorial constructions have become fundamental tools for computer science and applied mathematics. This book provides a thorough grounding in discrete probability and its applications in computing,at a level accessible to advanced undergraduates in the computational, mathematical and engineering sciences." Richard M. Karp, University of California, Berkeley

"This text presents a clear exposition of the tools of probabilistic analysis from the very basics to more advanced topics. In addition, each chapter offers a well-chosen set of problems for a range of abilities. This book is suitable for upper division undergraduates and first year graduate students in computer science and related disciplines. It will also be useful as a reference for researchers who would like to incorporate these tools into their work. I enjoyed teaching from the book and highly recommend it." Valerie King, University of Victoria

"The structure and pace of this book are well matched to the intended audience. The authors consistently maintain a good balance between theory and applicationsGood students will be challenged and yet average students will find the text very readable. This is a very attractive textbook." MAA, Bill Satzer

"The book can be used for self-study since there are exercises in each chapter."
Mathematics of Computation

Book Description
Assuming only an elementary background in discrete mathematics, this textbook is an great introduction to the probabilistic techniques and paradigms used in the development of probabilistic algorithms and analyses. It includes random sampling, expectations, Markov's and Chevyshev's inequalities, Chernoff bounds, balls and bins models, the probabilistic method, Markov chains, MCMC, martingales, entropy, and other topics. The book is designed to accompany a one- or two-semester course for graduate students in computer science and applied mathematics.

Reader Reviews
The authors must be smart guys. They obviously understand alot about this subject but make the mistake that you do too! As a result, the book is inadequate as a teaching tool. They use only half to a third of the narrative they need to adequately explain a subject. They also like to leave out proof steps or not explain them. The problems at the end of chapters are poor as well, since the authors seem to have forgotten to teach the techniques needed to solve most them in the chapter they belong to. I am sure to them it is intuitive. Comment | | (Report this)