Discrete probability and algorithms

Front Cover
Springer-Verlag, 1995 - Mathematics - 158 pages
0 Reviews
Discrete probability theory and the theory of algorithms have become close partners over the last ten years, though the roots of this partnership go back much longer. The papers in this volume address the latest developments in this active field. They are from the IMA Workshops "Probability and Algorithms" and "The Finite Markov Chain Renaissance." They represent the current thinking of many of the world's leading experts in the field.Researchers and graduate students in probability, computer science, combinatorics, and optimization theory will all be interested in this collection of articles. The techniques developed and surveyed in this volume are still undergoing rapid development, and many of the articles of the collection offer an expositionally pleasant entree into a research area of growing importance.

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.


On simulating a Markov chain stationary distribution when
A note on network reliability
at the interface

6 other sections not shown

Other editions - View all

Common terms and phrases

About the author (1995)

David Aldous has been both an actor and presenter on radio and television in the UK for the past twentyfive years. He currently presents a program for God TV and a radio show for Premier Radio.