Randomization has become prevalent, since it offers superior performance and simplicity. Parallel computing is also very important since it offers excellent speedups. This book combines the two domains, providing a summary of results and techniques in the area of randomized parallel computing.

The technique of randomization has become very prevalent since it offers superior performance and simplicity. Numerous researchers work in this area of vital importance. Parallel Computing is also very important since one can get excellent speedups using parallel computers. This book combines these two domains. It provides a summary of the state-of-the-art results and techniques in the area of randomized parallel computing. There are few texts in the area of randomized computing, and more surprisingly there is no text in the area of randomized parallel computing. Thus our book fills the void in this very important area. Audience: This is a reference book for researchers, educators, and students. It can also be used as a text for an advanced graduate course on randomized computing, parallel computing, or distributed computing.

Preface. Contributing Authors. 1. Optimal Bounds on Tail Probabilities: A Study of an Approach
A. Cohen, et al. 2. Parallelism in Comparison Problems
D. Krizanc. 3. Random Sampling
R. Raman. 4. Randomized Algorithms on the Mesh
L. Narayanan. 5. Efficient Randomized Algorithms
D.S.L. Wei, K. Naik. 6. Ultrafast Randomized Parallel Algorithms for Spanning Forests
A. Dessmark, et al. 7. Parallel Randomized Techniques for Some Fundamental Geometric Problems
S. Ramaswami. 8. Capturing the Connectivity of High-Dimensional Geometric Spaces
D. Hsu, et al. 9. Randomized Parallel Prefetching and Buffer Management
M. Kalluhalla, P.J. Varman. 10. DFA Problems
B. Ravikumar. 11. LAPACK90
J. Dongarra, J. Wasniewski. References. Appendix A. Appendix B. Appendix D. Appendix E. Index.