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

£39.00

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: 35.97 GBP
Availability: InStock

Algorithms

Price History & Forecast

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

Historical

Generating forecast...

Price Distribution

Price distribution over 87 days • 3 price levels

Days at Price

Current Price

Price Analysis

Most common price: £39 (59 days, 67.8%)

Price range: £35 - £39

Price levels: 3 different prices over 87 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.

Product Specifications

Brand: Cambridge University Press
Format: Paperback
ASIN: 1107606608
Category: Books > Subjects > Computing & Internet > Programming > Algorithms
Domain: Amazon UK
Publication Date: 10 May 2012
Listed Since: 07 December 2011

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

Product Specifications

Barcode

Similar Products You Might Like

Randomized Algorithms (Cambridge International Series on Parallel Computation)

Probability And Random Number: A First Guide To Randomness

Practical Analysis of Algorithms (Undergraduate Topics in Computer Science)

Methods in Algorithmic Analysis (Chapman & Hall/CRC Computer and Information Science Series)

Exercises in Probability: A Guided Tour From Measure Theory To Random Processes, Via Conditioning: 35 (Cambridge Series in Statistical and Probabilistic Mathematics, Series Number 35)

Applied Probability: From Random Experiments to Random Sequences and Statistics

Computational Complexity: A Quantitative Perspective (Volume 196) (North-Holland Mathematics Studies, Volume 196)

On the Estimation of Multiple Random Integrals and U-Statistics: 2079 (Lecture Notes in Mathematics, 2079)

Distribution Theory Of Runs And Patterns And Its Applications: A Finite Markov Chain Imbedding Approach

Algorithms as a Basis of Modern Applied Mathematics: 404 (Studies in Fuzziness and Soft Computing, 404)

Random Measures, Theory and Applications: 77 (Probability Theory and Stochastic Modelling, 77)

Independent Random Sampling Methods (Statistics and Computing)

Probability and Random Processes for Electrical and Computer Engineers

Algorithms and Theory of Computation Handbook, Volume 2: Special Topics and Techniques (Chapman & Hall/CRC Applied Algorithms and Data Structures series)

The Pleasures of Probability (Undergraduate Texts in Mathematics)

Computer Science and Operations Research: New Developments in their Interfaces

The Triangle-Free Process and the Ramsey Number $R(3,k)$ (Memoirs of the American Mathematical Society)

Selected Works of Murray Rosenblatt (Selected Works in Probability and Statistics)

Dynamics of Information Systems: Algorithmic Approaches: 51 (Springer Proceedings in Mathematics & Statistics, 51)

An Introduction to Random Matrices: 118 (Cambridge Studies in Advanced Mathematics, Series Number 118)

Introductory Statistics and Random Phenomena: Uncertainty, Complexity and Chaotic Behavior in Engineering and Science (Modern Birkhäuser Classics)

Stochastic Dynamic Programming and the Control of Queueing Systems: 505 (Wiley Series in Probability and Statistics)

Rabi N. Bhattacharya: Selected Papers (Contemporary Mathematicians)

Complexity and Approximation: In Memory of Ker-I Ko: 12000 (Lecture Notes in Computer Science, 12000)