Venezuelan computer scientist
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]
^ a b Cite error: The named reference mathgene
was invoked but never defined (see the help page ).
^ ACM Turing Award Citation , retrieved 2010-01-24.
^ Manuel Blum at DBLP Bibliography Server
^ Manuel Blum publications indexed by Microsoft Academic
^ 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 .
^ 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 .
^ 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 .
^ 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 .