Survey
paper on Randomized Algorithms: On Randomization in Sequential and
Distributed Algorithms, by Rajiv
Gupta, Scott
A. Smolka, and Shaji
Bhasar. Survey
paper on Randomized Algorithms: On Randomization in Sequential and
Distributed Algorithms, by Rajiv
Gupta, Scott
A. Smolka, and Shaji
Bhasar.
References
(including software pointer) on the Maximal
Common Subgraph (MCS) algorithm problem.
Bibliography
and syllabus for
a one semester course on Interactive Proofs (IP).
Some references
on the lower bound on NP-Complete
Problems.
Some references
to literature on complexity theory.
References
to P-complete problems and a (slightly
out of date) tech report A
Compendium of Problems Complete for P, by Raymond Greenlaw, H.
James Hoover, and Walter L. Ruzzo.
A report
containing a review of various string
matching algorithms by Graham A. Stephen.
A
compendium of NP Optimization Problems by P. Crescenzi and V. Kahn.
Probabilistic
Checking of Proofs and Hardness of Approximation Problems by Sanjeev
Arora.
Literature
on realistic parallel algorithms by Silvia
Goetz
The Quantum Complexity
Reference Collection.
The
Travelling Salesman Problem Bibliography.