☰

Manuel Blum

Affiliations: 
1984 University of California, Berkeley, Berkeley, CA, United States 
Google:
"Manuel Blum"
Tree Publications Similar researchers PubMed Report error

Parents

Sign in to add mentor
Marvin L. Minsky grad student 1964 MIT (Neurotree)
 (A Machine-Independent Theory of the Complexity of Recursive Functions)

Children

Sign in to add trainee
Leonard M. Adleman grad student UC Berkeley (Chemistry Tree)
Luis von Ahn grad student Carnegie Mellon
Dana Angluin grad student UC Berkeley
Nicholas J. Hopper grad student Carnegie Mellon
Russell Impagliazzo grad student UC Berkeley (E-Tree)
Moni Naor grad student UC Berkeley (MathTree)
Ronitt Rubinfeld grad student UC Berkeley (MathTree)
Steven Rudich grad student
Michael Sipser grad student UC Berkeley
Umesh Vazirani grad student UC Berkeley
Vijay V. Vazirani grad student UC Berkeley
Ryan Williams grad student UC Berkeley
Silvio Micali grad student 1983 UC Berkeley
Shafi Goldwasser grad student 1984 UC Berkeley

Collaborators

Sign in to add collaborator
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Blum M, Kannan S. (1995) Designing programs that check their work Journal of the Acm (Jacm). 42: 269-291
Cohen DS, Blum M. (1995) On the problem of sorting burnt pancakes Discrete Applied Mathematics. 61: 105-120
Blum M, Evans W, Gemmell P, et al. (1994) Checking the correctness of memories Algorithmica. 12: 225-244
Adleman LM, Blum M. (1991) Inductive inference and unsolvability Journal of Symbolic Logic. 56: 891-900
Blum M, Santis AD, Micali S, et al. (1991) Noninteractive zero-knowledge Siam Journal On Computing. 20: 1084-1118
Amato N, Blum M, Irani S, et al. (1989) Reversing trains: A turn of the century sorting problem Journal of Algorithms. 10: 413-428
Blum M. (1986) Independent unbiased coin flips from a correlated biased source:80a finite state Markov chain Combinatorica. 6: 97-108
Blum M, Micali S. (1984) How to generate cryptographically strong sequences of pseudo-random bits Siam Journal On Computing. 13: 850-864
Blum M. (1983) Coin flipping by telephone a protocol for solving impossible problems Sigact News. 15: 23-27
Blum M, Marques I. (1973) On Complexity Properties of Recursively Enumerable Sets Journal of Symbolic Logic. 38: 579-593
See more...