Resultado de búsqueda
Manuel Blum (born 26 April 1938) is a Venezuelan born American computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".
Manuel Blum (Caracas, Venezuela 26 de abril de 1938) es un informático venezolano conocido por ser el único sudamericano que ha recibido Premio Turing en 1995 "En reconocimiento de sus contribuciones a los fundamentos de la teoría de la complejidad computacional y su aplicación a la criptografía y la verificación de programas".
Computer Science Department Carnegie Mellon University 5000 Forbes Avenue Pittsburgh, PA 15213-3890, USA. mblum cs.cmu.edu. Executive Assistant: Nancy Conway nlc cs.cmu.edu Cell Phone: 412 596-4063. Download Manuel Blum's CV and Short Bio or Excessively Long Bio. Teaching.
faculty of the University of California at Berkeley. He became the Bruce Nelson University Professor of Computer Science at Carnegie Mellon in 2001. Blum has supervised the theses of 35 doctoral students who now pepper almost every major computer science department in the country.
Manuel Blum is a computer scientist who made fundamental contributions to computational complexity theory and its applications to cryptography and program checking. He invented the speedup theorem, the median finding algorithm, and the zero-knowledge proof protocol, among other achievements.
Manuel Blum, Venezuelan-born American mathematician and computer scientist and winner of the 1995 A.M. Turing Award in ‘recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking.’
Manuel Blum is a professor emeritus at Carnegie Mellon University and a pioneer in theoretical computer science. He received the 1995 Turing Award for his work on computational complexity theory, cryptography and program checking.
