
Some of the hardest computational problems have been successfully attacked through the use of probabilistic algorithms, which have an element of randomness to them. Concepts from the field of probability are also increasingly useful in analyzing the performance of algorithms, broadening our understanding beyond that provided by the worstcase or averagecase analyses.
This book surveys both of these emerging areas on the interface of the mathematical sciences and computer science. It is designed to attract new researchers to this area and provide them with enough background to begin explorations of their own.
Table of Contents

Front Matter

1 Introduction

2 Simulated Annealing

3 Approximate Counting Via Markov Chains

4 Probabilistic Algorithms for Speedup

5 Probabilistic Algorithms for Defeating Adversaries

6 Pseudorandom Numbers

7 Probabilistic Analysis of Packing and Related Partitioning Problems

8 Probability and Problems in Euclidean Combinatorial Optimization

9 Probabilistic Analysis in Linear Programming

10 Randomization in Parallel Algorithms

11 Randomly Wired Multistage Networks

12 Missing Pieces, Derandomization, and Concluding Remarks



    Introductory Statistics with R (Statistics and Computing)
This book provides an elementarylevel introduction to R, targeting both nonstatistician scientists in various fields and students of statistics. The main mode of presentation is via code examples with liberal commenting of the code and the output, from the computational as well as the statistical viewpoint. Brief sections introduce the... 
