
Research Peekaboom: A Game for Locating Objects in Images Luis von Ahn, Ruoran Liu and Manuel Blum. To Appear in ACM CHI 2006 (pdf) Improving Accessibility of the Web with a Computer Game Luis von Ahn, S. Ginosar, M. Kedia, R. Liu and M. Blum. To Appear in ACM CHI Notes 2006 (pdf) Toward a Highlevel Definition of Consciousness Manuel Blum, Ryan Williams Brendan Juba, Matt Humphrey. Invited Talk to the Annual IEEE Computational Complexity Conference , San Jose CA, (June 2005) (ppt) Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control Systems (NSF ITR proposal) (pdf) Telling Humans and Computers Apart Automatically: How Lazy Cryptographers do AI Luis von Ahn, Manuel Blum and John Langford. In Communications of the ACM, Feb. 2004. PDF CAPTCHA: Using Hard AI Problems for Security Luis von Ahn, Manuel Blum, Nicholas J. Hopper, John Langford. In Eurocrypt 2003 PDF / PS On the complexity of MAX / MIN / AVRG Circuits (with Rachel Rue, Ke Yang). 2002. CMU SCS Technical Report, CMUCS02110 PDF / abs Telling Humans and Computers Apart (Automatically) (with Luis von Ahn, John Langford ). 2002. CMU Tech Report PDF Secure Human Identification Protocols (with Nicholas J. Hopper). Advances in Crypotology, Proceedings of Asiacrypt 2001, December 2001: 5266 PDF / abs A Secure HumanComputer Authentication Scheme (with Nicholas J. Hopper).2000. CMUCS00139 May 2000 PDF / abs Software
Reliability via RunTime ResultChecking (with H. Wasserman). Journal
of the ACM. Reflections
on the Pentium Division Bug (with H. Wasserman). IEEE Transactions
on Computers, vol. 45, no. 4, April 1996, pp. 385393. Selftesting/correcting with applications to numerical problems (with Michael Luby, Ronitt Rubinfeld). In Proceedings of the TwentySecond Annual ACM Symposium on Theory of Computing, pages 7383, Baltimore, Maryland, 1416 May 1990. SelfTesting/Correcting with Applications to Numerical Problems (with M. Luby and R. Rubinfeld), STOC, 1990, p. 10. Designing programs that check their work (with Sampath Kannan) In Proceedings of the Twenty First Annual ACM Symposium on Theory of Computing, pages 8697, Seattle, Washington, 1517 May 1989. Noninteractive zeroknowledge and its applications (extended abstract).(with Paul Feldman, and Silvio Micali) In Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, pages 103112, Chicago, Illinois, 24 May 1988. A Simple Unpredictable PseudoRandom Number Generator (with Lenore Blum, Mike Shub). SIAM J. Comput. 15(2): 364383 (1986) How to Generate Cryptographically Strong Sequences of PseudoRandom Bits. (with Silvio Micali). SIAM J. Comput. 13(4): 850864 (1984) How to exchange (secret) keys (extended abstract). In Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pages 440447, Boston, Massachusetts, 2527 April 1983. Coin Flipping by Telephone. CRYPTO 1981: 1115 HTML On the Power of the Compass (or, Why Mazes are Easier to Search Than Graphs) (with D. Kozen), Proc. IEEE FOCS Conf., 1978, pp. 132142. Toward a Mathematical Theory of Inductive Inference (with L. Blum), Information and Control, Vol. 28, No. 2, 1975, pp. 125155. Linear time bounds for median computations (with Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, Robert E. Tarjan). In Conference Record, Fourth Annual ACM Symposium on Theory of Computing, pages 119124, Denver, Colorado, 13 May 1972. Linear Time Bounds for Median Computations (with Floyd, Pratt, Rivest, and Tarjan). Proc. 4th Annual ACM Symposium on Theory of Computing, 1972, pp. 119124. On effective procedures for speeding up algorithms In Conference Record of ACM Symposium on Theory of Computing, pages 4353, Marina del Rey, California, 57 May 1969. A MachineIndependent Theory of the Complexity of Recursive Functions. J. ACM, XIV, No. 2, 1967, pp. 322336.
