Back مانويل بلوم Arabic مانويل بلوم ARZ Manuel Blüm AZ مانوئل بلوم AZB ম্যানুয়েল ব্লাম Bengali/Bangla Manuel Blum Catalan Manuel Blum Czech Manuel Blum German Manuel Blum EO Manuel Blum Spanish

Manuel Blum

Manuel Blum
Manuel Blum (left) with his wife Lenore Blum and their son Avrim Blum, 1973
Born (1938-04-26) 26 April 1938 (age 86)
Caracas, Venezuela
Alma materMassachusetts Institute of Technology (BS, MS, PhD)
Known forBlum complexity axioms
Blum integer
Blum's speedup theorem
Blum Blum Shub
Blum–Goldwasser cryptosystem
Blum–Micali algorithm
CAPTCHA
reCAPTCHA
Commitment scheme
SpouseLenore Blum
AwardsACM's A.M. Turing Award, 1995
Distinguished Teaching Award, UC Berkeley, 1977
Sigma Xi's Monie A. Ferst Award, 1991
Herbert A.Simon Teaching award, 2007
Scientific career
FieldsComputer science
InstitutionsUniversity of California, Berkeley
Carnegie Mellon University
ThesisA Machine-Independent Theory of the Complexity of Recursive Functions (1964)
Doctoral advisorMarvin Minsky[1]
Doctoral studentsLeonard Adleman
Dana Angluin
C. Eric Bach
Shafi Goldwasser
Mor Harchol-Balter
Russell Impagliazzo
Silvio Micali
Gary Miller
Moni Naor
Ronitt Rubinfeld
Steven Rudich
Jeffrey Shallit
Michael Sipser
Umesh Vazirani
Vijay Vazirani
Luis von Ahn
Ryan Williams[1]
Websitewww.cs.cmu.edu/~mblum

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".[2][3][4][5][6][7][8]

  1. ^ a b Cite error: The named reference mathgene was invoked but never defined (see the help page).
  2. ^ ACM Turing Award Citation, retrieved 2010-01-24.
  3. ^ Manuel Blum at DBLP Bibliography Server Edit this at Wikidata
  4. ^ Manuel Blum publications indexed by Microsoft Academic
  5. ^ Blum, Manuel; Micali, Silvio (1984). "How to Generate Cryptographically Strong Sequences of Pseudorandom Bits" (PDF). SIAM Journal on Computing. 13 (4): 850. doi:10.1137/0213053. S2CID 7008910.
  6. ^ Blum, M.; Floyd, R. W.; Pratt, V. R.; Rivest, R. L.; Tarjan, R. E. (August 1973). "Time bounds for selection" (PDF). Journal of Computer and System Sciences. 7 (4): 448–461. doi:10.1016/S0022-0000(73)80033-9.
  7. ^ Blum, Manuel (1967). "A Machine-Independent Theory of the Complexity of Recursive Functions" (PDF). Journal of the ACM. 14 (2): 322–336. doi:10.1145/321386.321395. S2CID 15710280.
  8. ^ Blum, L.; Blum, M.; Shub, M. (1986). "A Simple Unpredictable Pseudo-Random Number Generator". SIAM Journal on Computing. 15 (2): 364. doi:10.1137/0215025.

Manuel Blum

Dodaje.pl - Ogłoszenia lokalne