Sciweavers

21 search results - page 1 / 5
» A Survey of Randomness and Parallelism in Comparison Problem...
Sort
View
IPPS
1998
IEEE
13 years 9 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc
IPPS
1998
IEEE
13 years 9 months ago
Randomized Algorithms on the Mesh
The mesh-connected array is an attractive architecture for parallel machines, and a number of existing parallel machines are based on a mesh topology. In this paper, we survey the ...
Lata Narayanan
DFG
1992
Springer
13 years 9 months ago
Complexity of Boolean Functions on PRAMs - Lower Bound Techniques
Determining time necessary for computing important functions on parallel machines is one of the most important problems in complexity theory for parallel algorithms. Recently, a s...
Miroslaw Kutylowski
IPPS
1998
IEEE
13 years 9 months ago
Randomization in Parallel Stringology
In this abstract, we provide an overview of our survey of randomized techniques for exploiting the parallelism in string matching problems. Broadly, the study of string matching fa...
S. Muthukrishnan