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

Info autore

JOEL H. SPENCER, PhD, is Professor of Mathematics and Computer Science at the Courant Institute of New York University. He is the cofounder and coeditor of the journal Random Structures and Algorithms and is also a Sloane Foundation Fellow.

Dettagli sul prodotto

• Con la collaborazione di: David Aldous (Editore), Persi Diaconis (Editore), Joel Spencer (Editore), J. Michael Steele (Editore), J. M. Steele (Editore), Laurent Saloff-Coste (Editore), Pers Diaconis (Editore), Joel Spencer et al (Editore)
• Editore: Springer, Berlin
• Contenuto: Libro
• Forma del prodotto: Tascabile
• Data pubblicazione: 30.01.2013
• Categoria: Scienze naturali, medicina, informatica, tecnica > Matematica > Altro
• EAN: 9781461269052
• ISBN: 978-1-4612-6905-2
• Numero di pagine: 158
• Illustrazioni: XVII, 158 p.
• Dimensioni (della confezione): 15.5 x 23.5 cm
• Peso (della confezione): 284 g
• Serie: The IMA Volumes in Mathematics and its Applications > .72; The IMA Volumes in Mathematics and its Applications > 72
• Categorie: Algorithms, Network, Wahrscheinlichkeitsrechnung und Statistik, Diskrete Mathematik, Combinatorics, Sets, Probabilitytheory, randomwalk, Markovchain