Manuel Blum

From Wikipedia, the free encyclopedia

Jump to: navigation, search
Manuel Blum
Image:Replace this image male.svg
BornApril 26 1938 (1938-04-26) (age 71)
Image:Flag of Venezuela.svg Caracas, Venezuela
ResidencePittsburgh, Pa
FieldComputer Science
InstitutionsUniversity of California, Berkeley
Carnegie Mellon University
Alma materMassachusetts Institute of Technology
Academic advisor  Marvin Minsky
Notable students  Leonard Adleman

Dana Angluin
C. Eric (Carl) Bach
William Evans
Peter Gemmell
John Gill, III
Shafrira Goldwasser
Mor Harchol-Balter
Diane Hernek
Nicholas Hopper
Russell Impagliazzo
Sampath Kannan
Silvio Micali
Gary Miller
Moni Naor
Ronnitt Rubinfeld
Steven Rudich
Troy Shahoumian
Jeffrey Shallit
Michael Sipser
Elizabeth Sweedyk
Umesh Vazirani
Vijay Vazirani
Hal Wasserman

Luis von Ahn
Notable prizesTuring Award

Manuel Blum (born 26 April 1938 in Caracas, Venezuela) is a 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".

Contents

[edit] Biography

Blum attended MIT, where he received his bachelor's degree and his master's degree in EECS in 1959 and 1961 respectively, and his Ph.D. in Mathematics in 1964 under professor Marvin Minsky.

He worked as a professor of computer science at the University of California, Berkeley until 1999 [1].

He is currently the Bruce Nelson Professor of Computer Science at Carnegie Mellon University, where his wife, Lenore Blum, and son, Avrim Blum, are also professors of Computer Science.

[edit] Work

In the 60s he developed an axiomatic complexity theory which was independent of concrete machine models. The theory is based on Gödel numberings and the Blum axioms. Even though the theory is not based on any machine model it yields concrete results like the compression theorem, the gap theorem, the honesty theorem and the celebrated Blum speedup theorem.

Some of his other work includes a protocol for flipping a coin over a telephone, a linear time Selection algorithm, the Blum Blum Shub pseudorandom number generator, the Blum-Goldwasser cryptosystem, and more recently CAPTCHAs.

His PhD Advisees, with unusual frequency, have gone on to very distinguished careers. Among them are Leonard Adleman, Shafi Goldwasser, Russell Impagliazzo, Silvio Micali, Moni Naor, Steven Rudich, Michael Sipser, Umesh and Vijay Vazirani, and Luis von Ahn.

[edit] See also

[edit] External links

Blum's home pages:

v • d • e
A. M. Turing Award Laureates

Perlis (1966) • Wilkes (1967) • Hamming (1968) • Minsky (1969) • Wilkinson (1970) • McCarthy (1971) • Dijkstra (1972) • Bachman (1973) • Knuth (1974) • Newell / Simon (1975) • Rabin / Scott (1976) • Backus (1977) • Floyd (1978) • Iverson (1979) • Hoare (1980) • Codd (1981) • Cook (1982) • Thompson / Ritchie (1983) • Wirth (1984) • Karp (1985) • Hopcroft / Tarjan (1986) • Cocke (1987) • Sutherland (1988) • Kahan (1989) • Corbató (1990) • Milner (1991) • Lampson (1992) • Hartmanis / Stearns (1993) • Feigenbaum / Reddy (1994) • Blum (1995) • Pnueli (1996) • Engelbart (1997) • Gray (1998) • Brooks (1999) • Yao (2000) • Dahl / Nygaard (2001) • Rivest / Shamir / Adleman (2002) • Kay (2003) • Cerf / Kahn (2004) • Naur (2005) • Allen (2006)


Persondata
NAME Blum, Manuel
ALTERNATIVE NAMES
SHORT DESCRIPTION Computer scientist
DATE OF BIRTH 1938-4-26
PLACE OF BIRTH Caracas, Venezuela
DATE OF DEATH
PLACE OF DEATH
de:Manuel Blum

es:Manuel Blum fr:Manuel Blum id:Manuel Blum he:מנואל בלום ja:マヌエル・ブラム pl:Manuel Blum fi:Manuel Blum

Retrieved from "http://india.smashits.com/wikipedia/Manuel_Blum"
Views
Personal tools

Toolbox