randomization techniques have been employed to solve numerous problems of computing both sequentially and in parallel. examples of randomized algorithms that are asymptotically better than their deterministic counterparts in solving various fundamental problems abound. randomized algorithms have the advantages of simplicity and better performance both in theory and often in practice. this two-volume handbook is a collection of articles written by renowned experts and cover a wide spectrum of issues in randomization. the handbook will be a valuable reference for all the important areas of algorithm design, including those essential to its applications in computer science and engineering. audience: the handbook is addressed to faculty, graduate students, and researchers in all areas of computer sciences, mathematics, operations research, and engineering.