Concentration of Measure for the Analysis of Randomized Algorithms - Image 1

£109.98

Cambridge University Press Concentration of Measure for the Analysis of Randomized Algorithms

Name: Concentration of Measure for the Analysis of Randomized Algorithms
Brand: Cambridge University Press
Price: 110.29 GBP
Availability: InStock

Illustrated

Algorithms

Price History & Forecast

Last 77 days • 77 data points (No recent data available)

Historical

Generating forecast...

Price Distribution

Price distribution over 77 days • 1 price levels

Days at Price

Price Analysis

Most common price: £110 (77 days, 100.0%)

Price range: £110 - £110

Price levels: 1 different prices over 77 days

Description

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.

Key Features

Used Book in Good Condition

Product Specifications

Brand: Cambridge University Press
Model: Illustrated
Format: hardcover
ASIN: 0521884276
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Release Date: 15 June 2009
Listed Since: 08 October 2008

Barcode

No barcode data available

Cambridge University Press Concentration of Measure for the Analysis of Randomized Algorithms

Price History & Forecast

Price Distribution

Price Analysis

Description

Key Features

Product Specifications

Barcode

Similar Products You Might Like

Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis

Computational Complexity: A Conceptual Perspective

Concentration Inequalities: A Nonasymptotic Theory of Independence

Random Matrices: High Dimensional Phenomena: 367 (London Mathematical Society Lecture Note Series, Series Number 367)

Random Matrix Methods for Machine Learning

Random Processes for Engineers

High-Dimensional Probability: An Introduction with Applications in Data Science: 47 (Cambridge Series in Statistical and Probabilistic Mathematics, Series Number 47)

Randomized Algorithms for Analysis and Control of Uncertain Systems (Communications and Control Engineering)

Springer Randomized Algorithms for Uncertain Systems - 2nd Ed

Probability: The Classical Limit Theorems

Algorithmic Randomness and Complexity: 0 (Theory and Applications of Computability)

Randomized Algorithms for Matrices and Data (Foundations and Trends (R) in Machine Learning)

Probability: The Classical Limit Theorems

A First Course in Random Matrix Theory: for Physicists, Engineers and Data Scientists

Uniform Central Limit Theorems: 142 (Cambridge Studies in Advanced Mathematics, Series Number 142)

Online Computation Compet Analysis

Modern Discrete Probability: An Essential Toolkit (Cambridge Series in Statistical and Probabilistic Mathematics)

The Probability Companion for Engineering and Computer Science

Cambridge Thinking Probabilistically - Mathematics Textbook

Random Matrix Methods for Wireless Communications

Random Networks for Communication: From Statistical Physics to Information Systems: 24 (Cambridge Series in Statistical and Probabilistic Mathematics, Series Number 24)

Probabilistic Inequalities: 7 (Series on Concrete & Applicable Mathematics)

Algorithmic Randomness: Progress and Prospects: 50 (Lecture Notes in Logic, Series Number 50)

Thinking Probabilistically: Stochastic Processes, Disordered Systems, and Their Applications (Cambridge Texts in Applied Mathematics)