Cited publications in Proceedings of the third annual ACM symposium on Theory of computing:The complexity of theorem-proving procedures (1971)On complexity as bounded rationality (extended abstract) (1994)Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time (2001)