Discrete Probability and Algorithms

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...

Full description

Corporate Author: SpringerLink (Online service)
Other Authors: Aldous, David (Editor), Diaconis, Persi (Editor), Spencer, Joel (Editor), Steele, J. Michael (Editor)
Format: eBook
Language:English
Published: New York, NY Springer New York 1995, 1995
Edition:1st ed. 1995
Series:The IMA Volumes in Mathematics and its Applications
Subjects:
Online Access:
Collection: Springer Book Archives -2004 - Collection details see MPG.ReNa
Summary: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
Physical Description:XVII, 158 p online resource
ISBN:9781461208013