Choice Reviews Online · 1996 · 422 citations · 217 references
ComputingComputer ScienceParallel AlgorithmsParallel ComputingTheory Of ComputationData ParallelismParallel Algorithm DesignParallel ArchitecturesParallel ComputationParallel Computer Architecture#P-complete ProblemsComplete ProblemsParallelization
This volume provides an ideal introduction to key topics in parallel computing. With its cogent overview of the essentials of the subject as well as lists of P -complete- and open problems, extensive remarks corresponding to each problem, a thorough index, and extensive references, the book will prove invaluable to programmers stuck on problems that are particularly difficult to parallelize. In providing an up-to-date survey of parallel computing research from 1994, Topics in Parallel Computing will prove invaluable to researchers and professionals with an interest in the super computers of the future.
217
V. J. Rayward‐Smith, Thomas H. Cormen, Charles E. Leiserson et al. · Journal of the Operational Research Society · 1991 · 17K citations
The complexity of theorem-proving procedures
Stephen Cook · 1971 · 6.2K citations · Full text
A new polynomial-time algorithm for linear programming
Narendra Karmarkar · COMBINATORICA · 1984 · 4.8K citations
Factoring polynomials with rational coefficients
A. K. Lenstra, H. W. Lenstra, László Lovász · Mathematische Annalen · 1982 · 4K citations · Full text