☰

Manuel Blum - Publications

Affiliations: 
1984 University of California, Berkeley, Berkeley, CA, United States 
Tree Info Similar researchers PubMed Report error

12 high-probability publications. We are testing a new system for linking publications to authors. You can help! If you notice any inaccuracies, please sign in and mark papers as correct or incorrect matches. If you identify any major omissions or other inaccuracies in the publication list, please let us know.

Year Citation  Score
1995 Blum M, Kannan S. Designing programs that check their work Journal of the Acm (Jacm). 42: 269-291. DOI: 10.1145/200836.200880  0.32
1995 Cohen DS, Blum M. On the problem of sorting burnt pancakes Discrete Applied Mathematics. 61: 105-120. DOI: 10.1016/0166-218X(94)00009-3  0.303
1994 Blum M, Evans W, Gemmell P, Kannan S, Naor M. Checking the correctness of memories Algorithmica. 12: 225-244. DOI: 10.1007/Bf01185212  0.504
1991 Adleman LM, Blum M. Inductive inference and unsolvability Journal of Symbolic Logic. 56: 891-900. DOI: 10.2307/2275058  0.592
1991 Blum M, Santis AD, Micali S, Persiano G. Noninteractive zero-knowledge Siam Journal On Computing. 20: 1084-1118. DOI: 10.1137/0220068  0.595
1989 Amato N, Blum M, Irani S, Rubinfeld R. Reversing trains: A turn of the century sorting problem Journal of Algorithms. 10: 413-428. DOI: 10.1016/0196-6774(89)90037-0  0.503
1986 Blum M. Independent unbiased coin flips from a correlated biased source:80a finite state Markov chain Combinatorica. 6: 97-108. DOI: 10.1007/Bf02579167  0.328
1984 Blum M, Micali S. How to generate cryptographically strong sequences of pseudo-random bits Siam Journal On Computing. 13: 850-864. DOI: 10.1137/0213053  0.624
1983 Blum M. Coin flipping by telephone a protocol for solving impossible problems Sigact News. 15: 23-27. DOI: 10.1145/1008908.1008911  0.347
1973 Blum M, Marques I. On Complexity Properties of Recursively Enumerable Sets Journal of Symbolic Logic. 38: 579-593. DOI: 10.2307/2271984  0.31
1973 Blum M, Floyd RW, Pratt V, Rivest RL, Tarjan RE. Time bounds for selection Journal of Computer and System Sciences. 7: 448-461. DOI: 10.1016/S0022-0000(73)80033-9  0.303
1971 Blum M. On Effective Procedures for Speeding Up Algorithms Journal of the Acm. 18: 290-305. DOI: 10.1145/321637.321648  0.342
Show low-probability matches.