**Randomized Algorithms**

by Wolfgang Merkle

**Publisher**: ESSLLI 2001**Number of pages**: 46

**Description**:

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models and briefly discusses related issues such as Rado-graphs and 0-1 laws.

Download or read it online for free here:

**Download link**

(370KB, PDF)

## Similar books

**Vector Models for Data-Parallel Computing**

by

**Guy Blelloch**-

**The MIT Press**

Vector Models for Data-Parallel Computing describes a model of parallelism that extends and formalizes the Data-Parallel model on which the Connection Machine and other supercomputers are based. It presents many algorithms based on the model.

(

**6475**views)

**Think Data Structures**

by

**Allen B. Downey**-

**Green Tea Press**

This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.

(

**2949**views)

**Algorithms for Clustering Data**

by

**Anil K. Jain, Richard C. Dubes**-

**Prentice Hall**

The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.

(

**12874**views)

**Algorithms and Data Structures for External Memory**

by

**Jeffrey Scott Vitter**-

**Now Publishers**

The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.

(

**6516**views)