Items related to Concentration of Measure for the Analysis of Randomized...
Synopsis
This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.
"synopsis" may belong to another edition of 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.
"About this title" may belong to another edition of this title.
Search results for Concentration of Measure for the Analysis of Randomized...
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780521884273_new
Quantity: Over 20 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
Used
Hardcover
Seller: Michener & Rutledge Booksellers, Inc., Baldwin City, KS, U.S.A.
Seller rating 5 out of 5 stars
Hardcover. Condition: Very Good. Bookplate, otherwise text clean and tight; no dust jacket; 8.90 X 6.10 X 0.90 inches; 214 pages. Seller Inventory # 208686
Quantity: 1 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms (Hardcover)
Published by
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: CitiRetail, Stevenage, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Seller Inventory # 9780521884273
Quantity: 1 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 480. Seller Inventory # C9780521884273
Quantity: Over 20 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Print on DemandSeller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock. This item is printed on demand. Seller Inventory # __0521884276
Quantity: 1 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: California Books, Miami, FL, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # I-9780521884273
Quantity: Over 20 available
Seller Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2010
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: moluna, Greven, Germany
Seller rating 4 out of 5 stars
Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms.Randomized algorithms have become a central part of the algorithms curriculum, based on their increasi. Seller Inventory # 446952167
Quantity: Over 20 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms (Hardcover)
Published by
Cambridge University Press, Cambridge, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: AussieBookSeller, Truganina, VIC, Australia
Seller rating 5 out of 5 stars
Hardcover. Condition: new. Hardcover. 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. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. Seller Inventory # 9780521884273
Quantity: 1 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Published by
Cambridge University Press, 2009
ISBN 10: 0521884276
ISBN 13: 9780521884273
New
Hardcover
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Feb2416190020256
Quantity: Over 20 available
Stock Image
Concentration of Measure for the Analysis of Randomized Algorithms
Seller: Revaluation Books, Exeter, United Kingdom
Seller rating 5 out of 5 stars
Hardcover. Condition: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock. Seller Inventory # x-0521884276
Quantity: 2 available