Concentration of Measure for the Analysis of Randomized Algorithms
Dubhashi, Devdatt P.; Panconesi, Alessandro
8 ratings by Goodreads
Language: English
Published by Cambridge University Press, 2009
- Hardcover
- New
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
5-star seller
AbeBooks seller since March 25, 2015
Hardcover
Condition: New
US$ 200.23
US$ 16.29 shipping
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Add to basketItem description from seller
In.
Seller Inventory # ria9780521884273_new
- Title
- Concentration of Measure for the Analysis of Randomized Algorithms
- Author
- Dubhashi, Devdatt P.; Panconesi, Alessandro
- Publisher
- Cambridge University Press
- Publication year
- 2009
- Condition
- New
- Binding
- Hardcover
- Language
- English
- ISBN 10
- 0521884276
- ISBN 13
- 9780521884273
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.
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.
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 the title" may belong to another edition of this title.
Ria Christie Collections
Uxbridge, United Kingdom
5-star seller
AbeBooks seller since March 25, 2015
Shipping rates from United Kingdom to U.S.A.
| Item | 6 to 12 business days | 6 to 12 business days |
|---|---|---|
| First item | US$ 16.29 | US$ 16.29 |
Payment methods
Store description
Hello!
Ria Christie Collections is an online venture that was initially set up in 2012 to sell books. We do not have a physical high street store. We are professional online booksellers. We only sell brand new books in perfect condition that we source from various suppliers and the publishers.
Primarily, our aim is to provide an excellent service to all our customers. We always work as a team to achieve this.
Our other objectives are to:
1. Ensure that all our products reach their destination quickly in a safe and secure manner
2. Answer to all our customer queries within 24 hours
3. Ensure that our customers are happy with their purchases
4. Provide all the items at a competitive price
5. Always listen to our customers
Ria Christie Collections is not a registered company. It is a Sole Trader venture. Other key information is shown below:
Contact Person Name: Rakesh Luchmun (Mr)
Storefront Name: Ria Christie Collections
Place of Establishment Address:
Suite B; ARUN House; ARUN Building
Arundel Road
Uxbridge
UB8 2RR
United Kingdom
E-Mail Address: riachristie@hotmail.co.uk
VAT Number: GB 160 5650 25
We always work hard and aim to comply with all of Abebooks Policies.
If you have any issues, please do not hesitate to write to us whether before or after a purchase. We promise to reply to you promptly and, in any case, within 24 hours.
Thank you kindly!
Yours sincerely
Mr Rakesh Luchmun (Founder) and the Ria Christie Collections Team
Specialty
Educational books, Textbooks, Fiction, Non- fictionSeller's business information
Ryefield Investments Limited
175 Pield Heath Road
Uxbridge, United Kingdom UB8 3NL
Terms of sale
All Returns and Refund are as per Abebooks policies.
Shipping terms
Orders usually ship within 2 business days. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. Thank you!