Concentration of Measure for the Analysis of Randomized Algorithms

4 avg rating
( 5 ratings by Goodreads )
 
9780521884273: Concentration of Measure for the Analysis of Randomized Algorithms

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 treatment of probabilistic techniques for obtaining high- probability estimates on the performance of randomized algorithms. It covers the basic tool kit from the Chernoff-Hoeffding (CH) bounds to more sophisticated techniques like Martingales and isoperimetric inequalities, as well as some recent developments like Talagrand's inequality, transportation cost inequalities, and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as CH bounds in dependent settings. The authors emphasize comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians.

"synopsis" may belong to another edition of this title.

Book Description:

Randomized algorithms have become a central part of the algorithms curriculum, based on their increasingly widespread use in modern. 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. The relative strengths and weaknesses of the methods are demonstrated by applying them to concrete problems.

About the Author:

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.

"About this title" may belong to another edition of this title.

Top Search Results from the AbeBooks Marketplace

1.

Dubhashi, Devdatt P., Panconesi, Alessan
Published by Cambridge University Press (2017)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 2
Print on Demand
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description Cambridge University Press, 2017. Hardcover. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # P110521884276

More Information About This Seller | Ask Bookseller a Question

Buy New
82.53
Convert Currency

Add to Basket

Shipping: 1.48
Within U.S.A.
Destination, Rates & Speeds

2.

Dubhashi, Devdatt P.
Published by Cambridge University Press (2009)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Quantity Available: > 20
Print on Demand
Seller:
Pbshop
(Wood Dale, IL, U.S.A.)
Rating
[?]

Book Description Cambridge University Press, 2009. HRD. Book Condition: New. New Book.Shipped from US within 10 to 14 business days.THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000. Bookseller Inventory # IP-9780521884273

More Information About This Seller | Ask Bookseller a Question

Buy New
90.87
Convert Currency

Add to Basket

Shipping: 2.96
Within U.S.A.
Destination, Rates & Speeds

3.

Dubhashi, Devdatt P.
Published by Cambridge University Press (2009)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Quantity Available: > 20
Print on Demand
Seller:
Books2Anywhere
(Fairford, GLOS, United Kingdom)
Rating
[?]

Book Description Cambridge University Press, 2009. HRD. Book Condition: New. New Book. Delivered from our US warehouse in 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND.Established seller since 2000. Bookseller Inventory # IP-9780521884273

More Information About This Seller | Ask Bookseller a Question

Buy New
88.59
Convert Currency

Add to Basket

Shipping: 9
From United Kingdom to U.S.A.
Destination, Rates & Speeds

4.

Dubhashi, Devdatt P.
Published by Cambridge University Press (2016)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Paperback Quantity Available: 1
Print on Demand
Seller:
Ria Christie Collections
(Uxbridge, United Kingdom)
Rating
[?]

Book Description Cambridge University Press, 2016. Paperback. Book Condition: New. PRINT ON DEMAND Book; New; Publication Year 2016; Not Signed; Fast Shipping from the UK. No. book. Bookseller Inventory # ria9780521884273_lsuk

More Information About This Seller | Ask Bookseller a Question

Buy New
96.31
Convert Currency

Add to Basket

Shipping: 3.87
From United Kingdom to U.S.A.
Destination, Rates & Speeds

5.

DEVDATT P. DUBHASHI , ALESSANDRO PANCONESI
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 1
Seller:
Herb Tandree Philosophy Books
(Stroud, GLOS, United Kingdom)
Rating
[?]

Book Description 2009. Hardback. Book Condition: NEW. 9780521884273 This listing is a new book, a title currently in-print which we order directly and immediately from the publisher. Bookseller Inventory # HTANDREE0482494

More Information About This Seller | Ask Bookseller a Question

Buy New
99.51
Convert Currency

Add to Basket

Shipping: 8
From United Kingdom to U.S.A.
Destination, Rates & Speeds

6.

Dubhashi, devdatt/ Panconesi, Alessandro
Published by Cambridge Univ Pr (2009)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 1
Seller:
Revaluation Books
(Exeter, United Kingdom)
Rating
[?]

Book Description Cambridge Univ Pr, 2009. Hardcover. Book Condition: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock. Bookseller Inventory # __0521884276

More Information About This Seller | Ask Bookseller a Question

Buy New
102.02
Convert Currency

Add to Basket

Shipping: 6
From United Kingdom to U.S.A.
Destination, Rates & Speeds

7.

Devdatt P. Dubhashi, Alessandro Panconesi
Published by CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2010)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 10
Print on Demand
Seller:
The Book Depository
(London, United Kingdom)
Rating
[?]

Book Description CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2010. Hardback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****.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 treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand s inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. Bookseller Inventory # APC9780521884273

More Information About This Seller | Ask Bookseller a Question

Buy New
112.46
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

8.

Dubhashi, Devdatt P.
Published by Cambridge University Press (2017)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: > 20
Print on Demand
Seller:
Murray Media
(North Miami Beach, FL, U.S.A.)
Rating
[?]

Book Description Cambridge University Press, 2017. Hardcover. Book Condition: New. Never used! This item is printed on demand. Bookseller Inventory # 0521884276

More Information About This Seller | Ask Bookseller a Question

Buy New
111.21
Convert Currency

Add to Basket

Shipping: 1.48
Within U.S.A.
Destination, Rates & Speeds

9.

Devdatt P. Dubhashi, Alessandro Panconesi
Published by CAMBRIDGE UNIVERSITY PRESS, United Kingdom (2010)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 10
Print on Demand
Seller:
The Book Depository US
(London, United Kingdom)
Rating
[?]

Book Description CAMBRIDGE UNIVERSITY PRESS, United Kingdom, 2010. Hardback. Book Condition: New. Language: English . Brand New Book ***** Print on Demand *****. 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 treatment of probabilistic techniques for obtaining high probability estimates on the performance of randomized algorithms. It covers the basic toolkit from the Chernoff-Hoeffding bounds to more sophisticated techniques like martingales and isoperimetric inequalities, as well as some recent developments like Talagrand s inequality, transportation cost inequalities and log-Sobolev inequalities. Along the way, variations on the basic theme are examined, such as Chernoff-Hoeffding bounds in dependent settings. The authors emphasise comparative study of the different methods, highlighting respective strengths and weaknesses in concrete example applications. The exposition is tailored to discrete settings sufficient for the analysis of algorithms, avoiding unnecessary measure-theoretic details, thus making the book accessible to computer scientists as well as probabilists and discrete mathematicians. Bookseller Inventory # APC9780521884273

More Information About This Seller | Ask Bookseller a Question

Buy New
117.31
Convert Currency

Add to Basket

Shipping: FREE
From United Kingdom to U.S.A.
Destination, Rates & Speeds

10.

Dubhashi, Devdatt P.; Panconesi, Alessandro
Published by Cambridge University Press (2009)
ISBN 10: 0521884276 ISBN 13: 9780521884273
New Hardcover Quantity Available: 10
Seller:
Ergodebooks
(RICHMOND, TX, U.S.A.)
Rating
[?]

Book Description Cambridge University Press, 2009. Hardcover. Book Condition: New. Bookseller Inventory # INGM9780521884273

More Information About This Seller | Ask Bookseller a Question

Buy New
114.01
Convert Currency

Add to Basket

Shipping: 6.66
Within U.S.A.
Destination, Rates & Speeds

There are more copies of this book

View all search results for this book