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

This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.

About this title

About the Authors

Devdatt P. Dubhashi is Professor in the Department of Computer Science and Engineering at Chalmers University, Sweden. He earned a Ph.D. in computer science from Cornell University and held positions at the Max-Planck-Institute for Computer Science in Saarbruecken, BRICS, the University of Aarhus and IIT Delhi. Dubhashi has published widely at international conferences and in journals, including many special issues dedicated to best contributions. His research interests span the range from combinatorics to probabilistic analysis of algorithms, and more recently, to computational systems biology and distributed information systems such as the Web.

Alessandro Panconesi is Professor of Computer Science at Sapienza University of Rome. He earned a Ph.D. in computer science from Cornell University and is the recipient of the 1992 ACM Danny Lewin Award. Panconesi has published more than 50 papers in international journals and selective conference proceedings and he is the associate editor of the Journal of Discrete Algorithms and the director of BiCi, the Bertinoro International Center of Informatics. His research spans areas of algorithmic research as diverse as randomized algorithms, distributed computing, complexity theory, experimental algorithmics, wireless networking and Web information retrieval.

Edition details

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