735 search results - page 17 / 147 » Randomization in Parallel Stringology |
113
Voted
ICSE
2007
IEEE-ACM
16 years 1 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...
149
click to vote
DFG
1992
Springer
15 years 6 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
15 years 5 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...
77
Voted
ICPADS
2006
IEEE
15 years 8 months ago
2006
IEEE
ISPA
2004
Springer
15 years 7 months ago
2004
Springer
