1996: Fellow of the
Association for Computing Machinery: "For several fundamental contributions to computational complexity theory, which have significantly affected the course of this field."[2]
Chandra, Ashok K.; Stockmeyer, Larry J. (1976). "17th Annual Symposium on Foundations of Computer Science (SFCS 1976)". Proc. 17th IEEE Symp. on Foundations of Computer Science. Houston, Texas. pp. 98–108.
doi:
10.1109/SFCS.1976.4.
Stockmeyer, Larry J. (1974), The Complexity of Decision Problems in Automata Theory and Logic (Thesis), Massachusetts Institute of Technology,
hdl:
1721.1/15540. PhD Thesis.
1996: Fellow of the
Association for Computing Machinery: "For several fundamental contributions to computational complexity theory, which have significantly affected the course of this field."[2]
Chandra, Ashok K.; Stockmeyer, Larry J. (1976). "17th Annual Symposium on Foundations of Computer Science (SFCS 1976)". Proc. 17th IEEE Symp. on Foundations of Computer Science. Houston, Texas. pp. 98–108.
doi:
10.1109/SFCS.1976.4.
Stockmeyer, Larry J. (1974), The Complexity of Decision Problems in Automata Theory and Logic (Thesis), Massachusetts Institute of Technology,
hdl:
1721.1/15540. PhD Thesis.