Order Total (1 Item Items):
Shipping Destination:
Concentration Measure Analysis Randomized by Dubhashi Devdatt (35 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (35)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (29)
- As New, Fine or Near Fine (3)
- Very Good or Good (3)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (1)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (9)
- Not Print on Demand (22)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Hardcover. Condition: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Condition: Good. Most items will be dispatched the same or the next working day. A copy that has been read but remains in clean condition. All of the pages are intact and the cover is intact and the spine may show signs of wear. The book may have minor markings which are not specifically mentioned.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 48.41
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
Condition: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: PBD; PBT; UMB. Category: (P) Professional & Vocational. Dimension: 227 x 153 x 13. Weight in Grams: 32. . 2012. Illustrated. paperback. . . . .
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press CUP, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New. pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: PBD; PBT; UMB. Category: (P) Professional & Vocational. Dimension: 227 x 153 x 13. Weight in Grams: 32. . 2012. Illustrated. paperback. . . . . Books ship from the US and Ireland.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Paperback. Condition: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 135.78
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Seller rating 5 out of 5 stars
First Edition
Condition: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 236 x 162 x 21. Weight in Grams: 458. . 2009. 1st Edition. hardcover. . . . .
-
Hardcover. Condition: Brand New. 1st edition. 248 pages. 8.90x6.10x0.90 inches. In Stock.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press CUP, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Condition: New. pp. xiv + 196.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Condition: New. This book presents a coherent and unified account of classical and more advanced techniques for analyzing the performance of randomized algorithms. Num Pages: 214 pages, 12 b/w illus. 168 exercises. BIC Classification: UYA. Category: (P) Professional & Vocational. Dimension: 236 x 162 x 21. Weight in Grams: 458. . 2009. 1st Edition. hardcover. . . . . Books ship from the US and Ireland.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Buch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Hardcover. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Paperback. Condition: new. Paperback. 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 ChernoffHoeffding 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 ChernoffHoeffding 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. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Paperback. Condition: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock. This item is printed on demand.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 52.41
£ 14.35 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New. Print on Demand pp. 214 12 Illus.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Condition: New. PRINT ON DEMAND pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Paperback. Condition: new. Paperback. 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 ChernoffHoeffding 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 ChernoffHoeffding 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. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Language: English
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
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.Über den AutorDevdatt P. Dubhashi is Professor in the Department of Computer Scie.
-
Concentration of Measure for the Analysis of Randomized Algorithms (Paperback)
Language: English
Published by Cambridge University Press, Cambridge, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Paperback. Condition: new. Paperback. 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 ChernoffHoeffding 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 ChernoffHoeffding 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. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.
