Sciweavers

IPPS
1998
IEEE

Random Sampling Techniques in Parallel Computation

13 years 7 months ago
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.
Rajeev Raman
Added 05 Aug 2010
Updated 05 Aug 2010
Type Conference
Year 1998
Where IPPS
Authors Rajeev Raman
Comments (0)