Random Sampling Techniques in Parallel Computation

Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in practice. We will focus on the use of random sampling in fundamental problems such as sorting, selection, list ranking and graph connectivity.

• Type: Conference
• Year: 1998
• Where: IPPS
• Authors: Rajeev Raman
• Keywords: Distributed And Parallel Computing, IPPS 1998, Parallel Algorithms, Random Sampling, Simple Parallel Algorithms