Devdatt P Dubhashi Alessandro Panconesi (21 results)

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

Hardcover. Condition: Very Good. Dust Jacket Condition: No Dust Jacket As Issued. Bookplate, otherwise text clean and tight; no dust jacket; 8.90 X 6.10 X 0.90 inches; 214 pages.

Condition: New. In English.

Condition: New.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 214.

Paperback. Condition: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.

Condition: New.

Condition: New. In English.

Hardback. Condition: New. 1st. 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.…

Condition: New. pp. xiv + 196.

Hardback. Condition: New. 1st. 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.…

Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: New. Print on Demand pp. 214 12 Illus.

Condition: New. PRINT ON DEMAND pp. 214.

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.&Uumlber den AutorDevdatt P. Dubhashi is Professor in the Department of Computer Scie.…

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.…

Condition: New. Print on Demand pp. xiv + 196 12 Illus.

Condition: New. PRINT ON DEMAND pp. xiv + 196.