ACADEMIC PROFESSIONAL EXPERIENCE (2010)
Advisors Sebastian Thrun, Geoff Gordon, Manuel Blum, Sven Koenig, Geoff Gordon, Maxim Likhachev Page, ...
Artificial Intelligence and Robotics: graph search-based planning, real-time planning, planning under uncertainty, planning for single and multi-agent systems including unmanned ground and aerial...
Our research is motivated by a simple but deep question: can computers work with high-level ideas to solve problems as well as they can push symbols and crunch numbers?
Graduate Research Assistant – worked under the supervision of (2008)
Advisors Geoff Gordon, Sebastian Thrun, Manuel Blum, Sven Koenig, Professors Sven Koenig, Ron Arkin
Major GPA: 4.0/4.0 Cumulative GPA: 3.9/4.0
Dissertation: New Theoretical Frameworks for Machine Learning. (2008)
Maiden Name Popa, Maria-florina Balcan, Avrim Blum, Manuel Blum, Yishay Mansour, Tom Mitchell, ...
Dependable Computing and Fault Tolerance (TSF) Team, CNRS, Toulouse, France.
Abstract Matching nuts and bolts (Extended Abstract) (2008)
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of bolts and nuts and wants to find the corresponding pairs of bolts and nuts. The procedure uses our...
� Practical Perspective (2008)
Matt Humphrey, Manuel Blum, Brendan Juba, Ryan Williams, Bridges Gap Between Human/computer
� See a proof in terms of “ideas” � Different levels of abstraction � Represented as a graph, tree, DAG? � Tool for directing exhaustive proof search � Formal Definition � No perfect...
Manuel Blum, Brendan Juba, Ryan Williams
In this paper, we examine the problem of finding optimal strategies in simple stochastic games, and the equivalent problem of finding stable configurations of MIN/MAX/AVG circuits. The problem can be...
09/05 – presently Carnegie Mellon University Pittsburgh, PA (2008)
Advisors Geoff Gordon, Sebastian Thrun, Manuel Blum, Sven Koenig
♦ Under with the supervision of Professor Tony Stentz, developed methods for efficient planning under uncertainty in large-scale domains and for multi-robot coordination. Applied these methods to...
Dissertation: New Theoretical Frameworks for Machine Learning. (2008)
Maiden Name Popa, Maria-florina Balcan, Avrim Blum, Manuel Blum, Yishay Mansour, Tom Mitchell, ...
Dependable Computing and Fault Tolerance (TSF) Team, CNRS, Toulouse, France.
Abstract Matching nuts and bolts (Extended Abstract) (2008)
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan
We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of bolts and nuts and wants to nd the corresponding pairs of bolts and nuts. The procedure uses our...
Hal Wasserman, Manuel Blum, Name Manuel Blum
We review the eld of result-checking, discussing simple checkers and self-correctors. We argue that such checkers could pro tably be incorporated in software as an aid to e cient debugging and...
New Theoretical Frameworks for Machine Learning (2008)
Maria-florina Balcan, Manuel Blum, Yishay Mansour, Tom Mitchell, Santosh Vempala
This thesis has two primary thrusts. The first is developing new models and algorithms for important modern and classic learning problems. The second is establishing new connections between Machine...
reCAPTCHA: Human-Based Character Recognition via Web Security Measures (2008)
Luis Von Ahn, Benjamin Maurer, Colin Mcmillen, David Abraham, Manuel Blum
widespread security measures on the World Wide Web that prevent automated programs from abusing online services. They do so by asking humans to perform a task that computers cannot yet perform, such...
Efficient Algorithms for Path Problems in Weighted Graphs (2008)
Virginia Vassilevska, Manuel Blum, Anupam Gupta
The views and conclusions contained in this document are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of any sponsoring...
Transcendental Degree, Manuel Blum, Bruno Codenotti, Peter Gemmell, Troy Shahoumian
We use algebraic field extension theory to find self-correctors for a broad class of functions. Many functions whose translations are contained in a function field that is a finite degree extension...
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f. Should we trust that P works correctly? A self-testing/correcting pair allows us to: (1)...
New Theoretical Frameworks for Machine Learning (2007)
Maria-florina Balcan, Manuel Blum, Yishay Mansour, Tom Mitchell, Santosh Vempala
This thesis develops and analyzes theoretical frameworks for new emerging paradigms of Machine Learning including Semi-supervised, Active, and Similarity-based Learning. These are areas of...
Presented to The Academic Faculty (2006)
Abraham D. Flaxman, Alan Frieze, R. Ravi, Manuel Blum, Luis Von Ahn, Maverick Woo, ...
This thesis considers the average case analysis of algorithms, focusing primarily on NP-hard combinatorial optimization problems. It includes a catalog of distributions frequently used in...
Improving Accessibility of the Web with a Computer Game (2006)
Luis Von Ahn, Shiry Ginosar, Mihir Kedia, Ruoran Liu, Manuel Blum
Images on the Web present a major accessibility issue for the visually impaired, mainly because the majority of them do not have proper captions. This paper addresses the problem of attaching proper...
Peekaboom: A Game for Locating Objects in Images (2006)
Luis Von Ahn, Ruoran Liu, Manuel Blum
We introduce Peekaboom, an entertaining web-based game that can help computers locate objects in images. People play the game because of its entertainment value, and as a side effect of them playing,...
Verbosity: a game for collecting common-sense facts (2006)
Luis Von Ahn, Mihir Kedia, Manuel Blum
We address the problem of collecting a database of “common-sense facts ” using a computer game. Informally, a common-sense fact is a true statement about the world that is known to most humans:...
Search-based Planning for Large Dynamic Environments (2005)
views and conclusions expressed in this publication are those of the author and should not be interpreted as representing the official policies, either expressed or implied, of DARPA, or the U.S....
Telling humans and computers apart automatically (2004)
Luis Von Ahn, Manuel Blum, John Langford
You’ve probably seen them—colorful images with distorted text in them at the bottom of Web registration forms. CAPTCHAs are used by Yahoo, Hotmail, PayPal and many other popular Web sites to...
Telling Humans and Computers Apart (Automatically) (2004)
Or How Lazy, Lazy Cryptographers Do Ai, Luis Von Ahn, Manuel Blum, John Langford
this article. Bongo. Another example of a captcha is the program we call bongo
Telling humans and computers apart automatically (2004)
Lazy Cryptographers Do Ai, Luis Ahn, Manuel Blum, John Langford
If you try to get a new email account at Yahoo, you’ll be asked to prove that you’re a human and not a computer. Why? Because a single computer program can get thousands of free email accounts...
CAPTCHA: Using Hard AI Problems For Security (2003)
Luis Von Ahn, Manuel Blum, John Langford
Abstract. We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an unsolved...
CAPTCHA: Using Hard AI Problems For Security (2003)
Luis Von Ahn, Manuel Blum, John Langford
Abstract. We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an unsolved...
Telling Humans and Computers Apart (Automatically) (2003)
Or How Lazy, Lazy Cryptographers Do Ai, Luis Ahn, Manuel Blum, John Langford
this article.
CAPTCHA: Using Hard AI Problems For Security (2003)
Luis Von Ahn, Manuel Blum, John Langford
Abstract. We introduce captcha, an automated test that humans can pass, but current computer programs can’t pass: any program that has high success over a captcha can be used to solve an unsolved...
CAPTCHA: Using Hard AI Problems For Security (2003)
Using Hard Ai, Luis Von Ahn, Manuel Blum, John Langford
We introduce captcha, an automated test that humans can pass, but current computer programs can't pass: any program that has high success over a captcha can be used to solve an unsolved...
On the Complexity of MAX/MIN/AVRG Circuits (2002)
Manuel Blum Rachel, Manuel Blum, Rachel Rue, Ke Yang
We study the complexity of a class of circuits, namely, the MAX/MIN/AVRG circuits. On the wires of these circuits are real values between 0 and 1# the functions each gate performs are MAX, MIN, and...
On the Complexity of MAX/MIN/AVRG Circuits (2002)
Manuel Blum Rachel, Manuel Blum, Rachel Rue, Ke Yang
We study the complexity of a class of circuits, namely, the MAX/MIN/AVRG circuits. On the wires of these circuits are real values between 0 and 1; the functions each gate performs are MAX, MIN, and...
Secure human identification protocols (2001)
Abstract. One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of protocols for...
Secure human identification protocols (2001)
Humanima Tification Protocols, Manuel Blum
One interesting and importantc hallenge for thec26H6kH2I6 c2 unity is that of providing secng authenticen2J and identific6488 for unassisted humans. There are a range of protocot forsec6H...
Secure human identification protocols (2001)
Humanima Tification Protocols, Manuel Blum
One interesting and importantc hallenge for thec26H6kH2I6 c2 unity is that of providing secng authenticen2J and identific6488 for unassisted humans. There are a range of protocot forsec6H...
Secure human identification protocols (2001)
Abstract. One interesting and important challenge for the cryptologic community is that of providing secure authentication and identification for unassisted humans. There are a range of protocols for...
A secure human-computer authentication scheme (2000)
We introduce a protocol for authentication between a human and a computer, where the human is able to use no special hardware other than a dumb terminal. Authentication is based on a shared secret...
A secure human-computer authentication scheme (2000)
We introduce a protocol for authentication between a human and a computer, where the human is able to use no special hardware other than a dumb terminal. Authentication is based on a shared secret...
Non-Interactive Zero Knowledge. (1998)
Blum, Manuel, De Santis, Alfredo, Micali, Silvio, Persiano, Giuseppe
We investigate the possibility of disposing of interaction between Prover and Verifier in a zero-knowledge proof if they share beforehand a short random string. Without any assumption, we prove that...
A Secure Human-Computer Authentication Scheme (1998)
Hopper, Nicholas J., Blum, Manuel
We introduce a protocol for authentication between a human and a computer, where the human is able to use no special hardware other than a dumb terminal. Authentication is based on a shared secret...
Reflections on the Pentium Division Bug (1995)
Manuel Blum, Hal Wasserman, I. A Gentle, Introduction Result-checking
We review the field of result-checking and suggest that it be extended to a methodology for enforcing hardware/software reliability. We thereby formulate a vision for "self-monitoring"...
A. Issues of Reliability (1995)
Manuel Blum, Hal Wasserman, I. A Gentle, Introduction Result-checking
We review the eld of result-checking and suggest that it be extended to a methodology for enforcing hardware/software reliability. We thereby formulate a vision for \self-monitoring"...
Designing programs that check their work (1995)
A program correctness checker is an algorithm for checking the output of a computation. This paper defines the concept of a program checker. It designs program checkers for a few specific and...
Checking the correctness of memories (1994)
Manuel Blum, Will Evans, Peter Gemmell, Sampath Kannan, Moni Naor
We extend the notion of program checking to include programs which alter their environment. In particular, we consider programs which store and retrieve data from memory. The model we consider allows...
Software Reliability via Run-Time Result-Checking (1994)
Manuel Blum Hal, Manuel Blum, Hal Wasserman
We review the field of result-checking, discussing simple checkers and selfcorrectors. We argue that such checkers could profitably be incorporated in software as an aid to efficient debugging and...
Matching Nuts and Bolts (Extended Abstract) (1994)
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
) Noga Alon y Manuel Blum z Amos Fiat x Sampath Kannan -- Moni Naor k Rafail Ostrovsky Abstract We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of...
Software Reliability via Run-Time Result-Checking (1994)
Hal Wasserman University, Hal Wasserman, Manuel Blum, Name Manuel Blum
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Checking the Correctness of Memories (1994)
Manuel Blum, Will Evans, Peter Gemmell, Sampath Kannan, Moni Naor
We extend the notion of program checking to include programs which alter their environment. In particular, we consider programs which store and retrieve data from memory. The model we consider allows...
Matching Nuts and Bolts (1994)
Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
) Noga Alon Manuel Blum y Amos Fiat z Sampath Kannan x Moni Naor -- Rafail Ostrovsky k Abstract We describe a procedure which may be helpful to any disorganized carpenter who has a mixed pile of...
Software Reliability via Run-Time Result-Checking (1994)
Hal Wasserman, Manuel Blum, Name Manuel Blum
ing with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works, requires prior specific permission...
Checking the Correctness of Memories (1994)
Manuel Blum, Will Evans, Peter Gemmell, Sampath Kannan, Moni Naor
Program checking has been thought of merely as checking the computation of a function which does not have any side effects. We extend the notion of program checking to include programs which alter...
Matching Nuts and Bolts (1993)
Exte Nd Ed, Noga Alon, Manuel Blum, Sampath Kannan, Moni Naor, Rafail Ostrovsky
) Noga Alon y Manuel Blum z Amos Fiat x Sampath Kannan -- Moni Naor k Rafail Ostrovsky TR-93-075 Novemeber, 1993 Abstract We describe a procedure which may be helpful to any disorganized carpenter...
Towards a Computational Theory of Statistical Tests (1992)
We initiate a computational theory of statistical tests. Loosely speaking, we say that an algorithm is a statistical test if it rejects a "negligible" fraction of strings. We say that a...
Non-Interactive Zero Knowledge (1991)
Manuel Blum, Alfredo De Santis, Silvio Micali, Giuseppe Persiano
We investigate the possibility of disposing of interaction between Prover and Verifier in a zeroknowledge proof if they share beforehand a short random string. Without any assumption, we prove that...
Self-Testing/Correcting with Applications to Numerical Problems (1990)
Manuel Blum, Michael Luby, Ronitt Rubinfeld
Suppose someone gives us an extremely fast program P that we can call as a black box to compute a function f . Should we trust that P works correctly? A self-testing/correcting pair for f allows us...
Manuel Blum, Michael Luby, Ronitt Rubinfeld
) Manuel Blum Computer Science Division U.C. Berkeley Berkeley, California 94720 Michael Luby International Computer Science Institute Berkeley, California 94704 Ronitt Rubinfeld y Computer Science...
Designing Programs That Check Their Work (1989)
Manuel Blum, Sampath Kannan, Comp Sci, Comp Sci
A program correctness checker is an algorithm for checking the output of a computation. That is, given a program and an instance on which the program is run, the checker certifies whether the output...
A Stability Test for Configurations of Blocks (1970)
Blum, Manuel, Griffith, Arnold, Neumann, Bernard
This work is based on notes provided by Manuel Blum, which are paraphrased in section I, and which contain the examples used in the appendix. The main portion of this report was written by Bernard...
A Stability Test for Configurations of Blocks (1970)
Blum, Manuel, Griffith, Arnold, Neumann, Bernard
This work is based on notes provided by Manuel Blum, which are paraphrased in section I, and which contain the examples used in the appendix. The main portion of this report was written by Bernard...
A machine-independent theory of the complexity of recursive functions / (1963)
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Mathematics, 1963.
Reliability of biological computers /--by Manuel Blum. (1961)
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering, 1961.
Reflections on the Pentium Division Bug
Manuel Blum And, Manuel Blum, Hal Wasserman
We review the field of result-checking and suggest that it be extended to a methodology for enforcing hardware/software reliability. We thereby formulate a vision for "self-monitoring"...