Stephen Cook and John Hopcroft introduce the concept of NP-completeness in computational complexity theory at the 3rd Annual ACM Symposium on Theory of Computing [REF].
Daniel Quillen publishes a proof of the Adams conjecture [REF].