Concentration of Measure for the Analysis of Randomized Algorithms - Softcover

Dubhashi, Devdatt P.

Softcover

ISBN 10: 1107606608 ISBN 13: 9781107606609

Publisher: Cambridge University Press, 2012

Synopsis

hard to find

About this title

Review:

Review of the hardback: 'It is beautifully written, contains all the major concentration results, and is a must to have on your desk.' Richard Lipton

Review of the hardback: 'Concentration bounds are at the core of probabilistic analysis of algorithms. This excellent text provides a comprehensive treatment of this important subject, ranging from the very basic to the more advanced tools, including some recent developments in this area. The presentation is clear and includes numerous examples, demonstrating applications of the bounds in analysis of algorithms. This book is a valuable resource for both researchers and students in the field.' Eli Upfal, Brown University

Review of the hardback: 'Concentration inequalities are an essential tool for the analysis of algorithms in any probabilistic setting. There have been many recent developments on this subject, and this excellent text brings them together in a highly accessible form.' Alan Frieze, Carnegie Mellon University

Review of the hardback: 'The book does a superb job of describing a collection of powerful methodologies in a unified manner; what is even more striking is that basic combinatorial and probabilistic language is used in bringing out the power of such approaches. To summarize, the book has done a great job of synthesizing diverse and important material in a very accessible manner. Any student, researcher, or practitioner of computer science, electrical engineering, mathematics, operations research, and related fields, could benefit from this wonderful book. The book would also make for fruitful classes at the undergraduate and graduate levels. I highly recommend it.' Aravind Srinivasan, SIGACT News

Review of the hardback: '... the strength of this book is that it is appropriate for both the beginner as well as the experienced researcher in the field of randomized algorithms ... The exposition style [...] combines informal discussion with formal definitions and proofs, giving first the intuition and motivation for the probabalistic technique at hand. ... I highly recommend this book both as an advanced as well as an introductory textbook, which can also serve the needs of an experienced researcher in algorithmics.' Yannis C. Stamatiou, Mathematical Reviews

Reviews of the hardback: 'This timely book brings together in a comprehensive and accessible form a sophisticated toolkit of powerful techniques for the analysis of randomized algorithms, illustrating their use with a wide array of insightful examples. This book is an invaluable resource for people venturing into this exciting field of contemporary computer science research.' Prabhakar Ragahavan, Yahoo Research

Book Description:

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern applications. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of such algorithms. The presentation emphasizes discrete settings and elementary notions of probability, making it accessible to computer scientists and applied discrete mathematicians.

About this edition

• Publisher: Cambridge University Press
• Publication date: 2012
• ISBN 10: 1107606608
• ISBN 13: 9781107606609
• Binding: Paperback
• Number of pages: 212