Resultado da Busca
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".
- 26 April 1938 (age 85), Caracas, Venezuela
- Lenore Blum
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 is a professor of computer science at Carnegie Mellon University and a leader in the fields of computational complexity, cryptography and program checking. He was born in Venezuela, studied at MIT and Berkeley, and received the 1995 Turing Award for his contributions to theoretical computer science.
Manuel Blum (Caracas, 26 de abril de 1938) é um informático venezuelano. Obteve um doutorado em 1964 no Instituto de Tecnologia de Massachusetts, orientado por Marvin Minsky. [1]
- Estados Unidos
- Pittsburgh
Manuel Blum. University Professor Emeritus. Website. Office 5013 Gates and Hillman Centers. Email mblum@cs.cmu.edu. Phone (412) 268-3742. Department Computer Science Department. Administrative Support Person Charlotte Yano. Research Interests Algorithms and Complexity Cryptography Security and Privacy. Research/Teaching Statement.
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.
