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 Computingby 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.
(10764 views)
Algorithms and Data Structures for External Memoryby 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.
(10733 views)
Open Data Structures: An Introductionby Pat Morin - AU Press
Offered as an introduction to the field of data structures and algorithms, the book covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs.
(14342 views)
Data Structures and Algorithm Analysis in Javaby Clifford A. Shaffer - Dover Publications
A comprehensive treatment focusing on the creation of efficient data structures and algorithms, explaining how to select the data structure best suited to specific problems. It uses Java programming language and is suitable for second-year courses.
(17639 views)