Stearns on writing "On the Computational Complexity of Algorithms”
Richard E. Stearns, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the collaboration with Juris Hartmanis that led to “On the Computational Complexity of Algorithms” and the establishment of algorithmic complexity as a field of computer science research. This clip is taken from an interview conducted with Stearns by Dan Rosenkrantz for the ACM on November 15, 2017 in Albany, New York. Video of the full interview is available as part of Stearns’ ACM profile at https://amturing.acm.org/award_winners/stearns_1081900.cfm.
Richard E. Stearns, winner of the Association for Computing Machinery's A.M. Turing Award, discusses the collaboration with Juris Hartmanis that led to “On the Computational Complexity of Algorithms” and the establishment of algorithmic complexity as a field of computer science research. This clip is taken from an interview conducted with Stearns by Dan Rosenkrantz for the ACM on November 15, 2017 in Albany, New York. Video of the full interview is available as part of Stearns’ ACM profile at https://amturing.acm.org/award_winners/stearns_1081900.cfm.