735 search results - page 17 / 147 » Randomization in Parallel Stringology |
ICSE
2007
IEEE-ACM
14 years 7 months ago
2007
IEEE-ACM
Model checkers search the space of possible program behaviors to detect errors and to demonstrate their absence. Despite major advances in reduction and optimization techniques, s...
DFG
1992
Springer
13 years 11 months ago
1992
Springer
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...
FSTTCS
1990
Springer
13 years 11 months ago
1990
Springer
We show that selection on an input of size N can be performed on a P-node hypercube (P = N/(log N)) in time O(N/P) with high probability, provided each node can process all the in...
ICPADS
2006
IEEE
14 years 1 months ago
2006
IEEE
ISPA
2004
Springer
14 years 23 days ago
2004
Springer
