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
A=Bby Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger - AK Peters, Ltd.
The book shows how some computer algorithms can simplify complex summations and if there is no such simplification they will prove this to be the case. The authors present the underlying mathematical theory, and the principle theorems and proofs.
(21559 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.
(12049 views)
Algorithms for Clustering Databy 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.
(15657 views)
Algorithms and Data Structuresby Niklaus Wirth - Prentice Hall
The book treats practically important algorithms and data structures. It starts with a chapter on data structure, then it treats sorting algorithms, concentrates on several examples of recursion, and deals with dynamic data structures.
(13614 views)