"...extremely elegant...I am sure that students will find great pleasure in using the book--and that teachers will have the same pleasure in using it to prepare a course on the subject." Mathematics of Computation
"Here Haggstrom takes the beginning student from the first definitions concerning Markov chains even beyond Propp-Wilson to its refinementss and applications, all in just a hundred or so generously detailed pages. If an undergraduate reading this book comes away saying "I should have thought of that!" then the psychological barrier between school mathematics and research will have begun to break down. Few mathematical monographs provide a comparable opportunity. General readers; lower-division undergraduates through professionals." Choice
"[This series] is generally good....The use of examples to introduce the various algorithms is especially effective and makes the text easier to read." Mathematical Reviews
"The numerous examples perfectly well illustrate the more theoretical points. I am sure that students will find great pleasure in using the book-and that teachers will have the same pleasure in using it to prepare a course on the subject." Mathematics of Computation
Based on a lecture course given at Chalmers University, this book is ideal for advanced undergraduate or beginning graduate students. The author first develops the necessary background in probability theory before applying it to study a range of randomised algorithms that have important applications in computing. This book will appeal not only to mathematicians, but to students of computer science who will find much here that appeals. This is a clear and concise introduction to this subject and the numerous exercises included will help students to deepen their understanding.