Manuel Blum

Jeremiah Blocki, Manuel Blum, Anupam Datta: Naturally Rehearsing Passwords. CoRR abs/1302.5122 (2013)

Manuel Blum, Jost Tobias Springenberg, Jan Wülfing, Martin Riedmiller: A learned feature descriptor for object recognition in RGB-D data. ICRA 2012: 1298-1303

Manuel Blum: Understanding and Inductive Inference. COCOON 2010: 1

Luis von Ahn, Ruoran Liu, Manuel Blum: Peekaboom: a game for locating objects in images. CHI 2006: 55-64

Luis von Ahn, Mihir Kedia, Manuel Blum: Verbosity: a game for collecting common-sense facts. CHI 2006: 75-78

Luis von Ahn, Shiry Ginosar, Mihir Kedia, Ruoran Liu, Manuel Blum: Improving accessibility of the web with a computer game. CHI 2006: 79-82

Luis von Ahn, Manuel Blum, John Langford: Telling humans and computers apart automatically. Commun. ACM 47(2): 56-60 (2004)

Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford: CAPTCHA: Using Hard AI Problems for Security. EUROCRYPT 2003: 294-311

Nicholas J. Hopper, Manuel Blum: Secure Human Identification Protocols. ASIACRYPT 2001: 52-66

Hal Wasserman, Manuel Blum: Software reliability via run-time result-checking. J. ACM 44(6): 826-849 (1997)

Manuel Blum: Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract). ALT 1997: 1

Manuel Blum, Hal Wasserman: Reflections on the Pentium Bug. IEEE Trans. Computers 45(4): 385-393 (1996)

David S. Cohen, Manuel Blum: on the Problem of Sorting Burnt Pancakes. Discrete Applied Mathematics 61(2): 105-120 (1995)

Manuel Blum, Sampath Kannan: Designing Programs that Check Their Work. J. ACM 42(1): 269-291 (1995)

Amihood Amir, Manuel Blum, Michael C. Loui, John E. Savage, Carl Smith: Contributions of theoretical computer science. SIGACT News 26(4): 2-4 (1995)

Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian: Self-Correcting for Function Fields Transcendental Degree. ICALP 1995: 547-557

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories. Algorithmica 12(2/3): 225-244 (1994)

Manuel Blum, Hal Wasserman: Program Result-Checking: A Theory of Testing Meets a Test of Theory. FOCS 1994: 382-392

Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky: Matching Nuts and Bolts. SODA 1994: 690-696

Manuel Blum, Michael Luby, Ronitt Rubinfeld: Self-Testing/Correcting with Applications to Numerical Problems. J. Comput. Syst. Sci. 47(3): 549-595 (1993)

Manuel Blum: Program Result Checking: A New Approach to Making Programs More Reliable. ICALP 1993: 1-14

Manuel Blum: Designing Programs to Check Their Work (Abstract). ISSTA 1993: 1

Sigal Ar, Manuel Blum, Bruno Codenotti, Peter Gemmell: Checking approximate computations over the reals. STOC 1993: 786-795

Manuel Blum, Oded Goldreich: Towards a Computational Theory of Statistical Tests (Extended Abstract). FOCS 1992: 406-416

Manuel Blum: Universal Statistical Tests. LATIN 1992: 71-75

Leonard M. Adleman, Manuel Blum: Inductive Inference and Unsolvability. J. Symb. Log. 56(3): 891-900 (1991)

Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano: Noninteractive Zero-Knowledge. SIAM J. Comput. 20(6): 1084-1118 (1991)

Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor: Checking the Correctness of Memories. FOCS 1991: 90-99

Manuel Blum: Program Checking. FSTTCS 1991: 1-9

Manuel Blum, Michael Luby, Ronitt Rubinfeld: Self-Testing/Correcting with Applications to Numerical Problems. STOC 1990: 73-83

Nancy M. Amato, Manuel Blum, Sandy Irani, Ronitt Rubinfeld: Reversing Trains: A Turn of the Century Sorting Problem. J. Algorithms 10(3): 413-428 (1989)

Manuel Blum, Prabhakar Raghavan: Program Correctness: Can One Test For It? IFIP Congress 1989: 127-134

Manuel Blum, Sampath Kannan: Designing Programs That Check Their Work. STOC 1989: 86-97

Manuel Blum, Paul Feldman, Silvio Micali: Proving Security Against Chosen Cyphertext Attacks. CRYPTO 1988: 256-268

Manuel Blum, Paul Feldman, Silvio Micali: Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract). STOC 1988: 103-112

Manuel Blum, Russell Impagliazzo: Generic Oracles and Oracle Classes (Extended Abstract). FOCS 1987: 118-126

Manuel Blum: Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. Combinatorica 6(2): 97-108 (1986)

Lenore Blum, Manuel Blum, Mike Shub: A Simple Unpredictable Pseudo-Random Number Generator. SIAM J. Comput. 15(2): 364-383 (1986)

Manuel Blum, Silvio Micali: How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Comput. 13(4): 850-864 (1984)

Manuel Blum, Shafi Goldwasser: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. CRYPTO 1984: 289-302

Manuel Blum: Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain. FOCS 1984: 425-433

Manuel Blum: How to Exchange (Secret) Keys. ACM Trans. Comput. Syst. 1(2): 175-193 (1983)

Manuel Blum, Umesh V. Vazirani, Vijay V. Vazirani: Reducibility Among Protocols. CRYPTO 1983: 137-146

Manuel Blum: How to Exchange (Secret) Keys (Extended Abstract). STOC 1983: 440-447

Manuel Blum: Coin Flipping by Telephone - A Protocol for Solving Impossible Problems. COMPCON 1982: 133-137

Lenore Blum, Manuel Blum, Mike Shub: Comparison of Two Pseudo-Random Number Generators. CRYPTO 1982: 61-78

Manuel Blum, Silvio Micali: How to Generate Cryptographically Strong Sequences of Pseudo Random Bits. FOCS 1982: 112-117

Manuel Blum, Richard M. Karp, Oliver Vornberger, Christos H. Papadimitriou, Mihalis Yannakakis: The Complexity of Testing Whether a Graph is a Superconcentrator. Inf. Process. Lett. 13(4/5): 164-167 (1981)

Manuel Blum: Coin Flipping by Telephone. CRYPTO 1981: 11-15

Manuel Blum, Ashok K. Chandra, Mark N. Wegman: Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time. Inf. Process. Lett. 10(2): 80-82 (1980)

Manuel Blum, Dexter Kozen: On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs). FOCS 1978: 132-142

Manuel Blum, William J. Sakoda: On the Capability of Finite Automata in 2 and 3 Dimensional Space. FOCS 1977: 147-161

Lenore Blum, Manuel Blum: Toward a Mathematical Theory of Inductive Inference. Information and Control 28(2): 125-155 (1975)

John Gill, Manuel Blum: On Almost Everywhere Complex Recursive Functions. J. ACM 21(3): 425-435 (1974)

Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan: Time Bounds for Selection. J. Comput. Syst. Sci. 7(4): 448-461 (1973)

Manuel Blum, Ivan Marques: On Complexity Properties of Recursively Enumerable Sets. J. Symb. Log. 38(4): 579-593 (1973)

Lenore Blum, Manuel Blum: Inductive Inference: A Recursion Theoretic Approach. SWAT (FOCS) 1973: 200-208

Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan: Linear Time Bounds for Median Computations. STOC 1972: 119-124

Manuel Blum: On Effective Procedures for Speeding Up Algorithms. J. ACM 18(2): 290-305 (1971)

Manuel Blum: On Effective Procedures for Speeding Up Algorithms. STOC 1969: 43-53

Patrick C. Fischer, Juris Hartmanis, Manuel Blum: Tape Reversal Complexity Hierarchies. SWAT (FOCS) 1968: 373-382

Manuel Blum: On the Size of Machines. Information and Control 11(3): 257-265 (1967)

Manuel Blum: A Machine-Independent Theory of the Complexity of Recursive Functions. J. ACM 14(2): 322-336 (1967)

Manuel Blum, Carl Hewitt: Automata on a 2-Dimensional Tape. SWAT (FOCS) 1967: 155-160