The Random Adversary: A Lower-Bound Technique for Randomized Parallel Algorithms.
Philip D. MacKenziePublished in: SIAM J. Comput. (1997)
Keyphrases
- parallel algorithm
- lower bound
- upper bound
- randomized algorithms
- branch and bound algorithm
- parallel computation
- randomized algorithm
- parallel programming
- branch and bound
- shared memory
- objective function
- optimal solution
- lower and upper bounds
- np hard
- cluster of workstations
- sufficiently accurate
- discovery of association rules
- combinatorial search problems
- parallel version
- pc cluster
- parallel implementations
- wireless sensor networks
- interconnection networks
- search space