Order Total (1 Item Items):
Shipping Destination:
Dubhashi Devdatt P Panconesi Alessandro (21 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (21)
- 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 (17)
- As New, Fine or Near Fine (3)
- Very Good or Good (1)
- Fair or Poor (No further results match this refinement)
- As Described (No further results match this refinement)
Binding
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (8)
- Not Print on Demand (18)
Language (1)
Price
- Any Price
- Under £ 20 (No further results match this refinement)
- £ 20 to £ 35 (No further results match this refinement)
- Over £ 35
Free Shipping
Seller Location
Seller Rating
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press CUP, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: New. pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
£ 50.39
Convert currency£ 6.50 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New. pp. 214 12 Illus.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Seller: Rarewaves.com USA, London, LONDO, United Kingdom
Seller rating 5 out of 5 stars
£ 60.59
Convert currencyFree shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. 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
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 47.14
Convert currency£ 11.98 shipping 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
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Condition: New. pp. 214.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
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
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 47.13
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
£ 53.52
Convert currency£ 15 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketCondition: As New. Unread book in perfect condition.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
£ 63.16
Convert currency£ 25 shipping from United Kingdom to U.S.A.Quantity: 2 available
Add to basketPaperback. Condition: Brand New. 216 pages. 8.90x5.90x0.70 inches. In Stock.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, GB, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
£ 54.76
Convert currency£ 65 shipping from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketPaperback. Condition: New. 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
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
Condition: New.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 133.14
Convert currency£ 11.98 shipping 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
Published by Cambridge University Press, 2009
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
£ 234
Convert currency£ 25 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
-
Concentration of Measure for the Analysis of Randomized Algorithms
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
£ 46.88
Convert currency£ 25 shipping from United Kingdom to U.S.A.Quantity: 1 available
Add to basketPaperback. 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
Published by Cambridge University Press, 2012
ISBN 10: 1107606608 ISBN 13: 9781107606609
Language: English
£ 37.65
Convert currency£ 42.57 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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
Published by Cambridge University Press, 2010
ISBN 10: 0521884276 ISBN 13: 9780521884273
Language: English
£ 148.52
Convert currency£ 42.57 shipping from Germany to U.S.A.Quantity: Over 20 available
Add to basketCondition: 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.
