Manuel Blum

Q: What Schools Are Affiliated With Manuel Blum

Manuel Blum is affiliated with the following schools: University of California, Berkeley, Princeton University, Carnegie Mellon University, Massachusetts Institute of Technology

Manuel Blum's AcademicInfluence.com Rankings

Manuel Blum

Computer Science

#127

World Rank

#134

Historical Rank

#75

USA Rank

Theoretical Computer Science

#16

World Rank

#16

Historical Rank

USA Rank

computer-science Degrees

Manuel Blum

Mathematics

#250

World Rank

#543

Historical Rank

#121

USA Rank

Measure Theory

#1255

World Rank

#1592

Historical Rank

#453

USA Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Manuel Blum's Degrees

Masters Electrical Engineering Princeton University

Why Is Manuel Blum Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Manuel Blum is a Venezuelan born American computer scientist who received the Turing Award in 1995 "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program checking".

(See a Problem?)

Manuel Blum's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

CAPTCHA: Using Hard AI Problems for Security (2003) (1596)
How to generate cryptographically strong sequences of pseudo random bits (1982) (1496)
Time Bounds for Selection (1973) (1313)
reCAPTCHA: Human-Based Character Recognition via Web Security Measures (2008) (1189)
A Simple Unpredictable Pseudo-Random Number Generator (1986) (1016)
Self-testing/correcting with applications to numerical problems (1990) (964)
Telling humans and computers apart automatically (2004) (904)
Non-interactive zero-knowledge and its applications (2019) (776)
A Machine-Independent Theory of the Complexity of Recursive Functions (1967) (765)
Peekaboom: a game for locating objects in images (2006) (641)
Toward a Mathematical Theory of Inductive Inference (1975) (635)
Designing programs that check their work (1989) (607)
Secure Human Identification Protocols (2001) (592)
Coin flipping by telephone a protocol for solving impossible problems (1983) (522)
Verbosity: a game for collecting common-sense facts (2006) (366)
Noninteractive Zero-Knowledge (1991) (328)
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) (1988) (322)
Checking the correctness of memories (1991) (317)
An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information (1985) (283)
How to Prove a Theorem So No One Else Can Claim It (2010) (254)
Software reliability via run-time result-checking (1997) (230)
Automata on a 2-Dimensional Tape (1967) (226)
On the power of the compass (or, why mazes are easier to search than graphs) (1978) (206)
How to exchange (secret) keys (1983) (192)
Improving accessibility of the web with a computer game (2006) (191)
Independent unbiased coin flips from a correlated biased source—A finite state markov chain (1984) (185)
Non-Interactive Zero Knowledge (1990) (155)
Coin Flipping by Telephone. (1981) (151)
Generic oracles and oracle classes (1987) (145)
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time (1980) (141)
On the Size of Machines (1967) (140)
Telling Humans and Computers Apart Automatically or How Lazy Cryptographers do AI (2002) (108)
Comparison of Two Pseudo-Random Number Generators (1982) (108)
Designing programs that check their work (1995) (103)
On the capability of finite automata in 2 and 3 dimensional space (1977) (101)
The Complexity of Testing Whether a Graph is a Superconcentrator (1981) (90)
A Secure Human-Computer Authentication Scheme (2000) (88)
on the Problem of Sorting Burnt Pancakes (1995) (83)
Inductive inference and unsolvability (1991) (76)
On Effective Procedures for Speeding Up Algorithms (1971) (70)
Improving Image Search with PHETCH (2007) (62)
On complexity properties of recursively enumerable sets (1973) (58)
Toward a theory of steganography (2004) (55)
Linear time bounds for median computations (1972) (52)
How to exchange (secret) keys (1983) (51)
Program result-checking: a theory of testing meets a test of theory (1994) (51)
Checking approximate computations over the reals (1993) (47)
Algorithms and resource requirements for fundamental problems (2007) (42)
A Stability Test for Configurations of Blocks (1970) (39)
Reflections on the Pentium Bug (1996) (39)
ClaimEval: Integrated and Flexible Framework for Claim Evaluation Using Credibility of Sources (2016) (37)
Matching nuts and bolts (1994) (34)
Reflections on the Pentium Division Bug (1995) (33)
Program Result Checking against Adaptive Programs and in Cryptographic Settings (1989) (33)
Naturally Rehearsing Passwords (2013) (33)
Program Result Checking: A New Approach to Making Programs More Reliable (1993) (31)
Proving Security Against Chosen Cyphertext Attacks (1988) (30)
A simple secure pseudo-random number generator (1982) (27)
Improving Audio CAPTCHAs (2008) (27)
On the central limit theorem for correlated random variables (1964) (23)
Generic Oracles and Oracle Classes (Extended Abstract) (1987) (22)
OpenEval: Web Information Query Evaluation (2013) (21)
Publishable Humanly Usable Secure Password Creation Schemas (2015) (19)
Reversing Trains: A Turn of the Century Sorting Problem (1989) (18)
GOTCHA password hackers! (2013) (17)
The complexity of human computation via a concrete model with an application to passwords (2017) (16)
A Review of Bot Protection using CAPTCHA for Web Security (2013) (16)
A theory of consciousness from a theoretical computer science perspective: Insights from the Conscious Turing Machine (2021) (15)
Machine dependence of degrees of difficulty. (1965) (15)
On Almost Everywhere Complex Recursive Functions (1974) (14)
How to Exchange (Secret) Keys (Extended Abstract) (1983) (14)
Towards Human Computable Passwords (2014) (13)
Coin Flipping over the Telephone (1982) (12)
A Theoretical Computer Science Perspective on Consciousness (2020) (12)
Human Computable Passwords (2014) (11)
On the Complexity of MAX/MIN/AVRG Circuits (2002) (11)
Program Correctness: Can One Test For It? (1989) (11)
Inductive Inference: A Recursion Theoretic Approach (1973) (11)
Cryptographically Strong Sequences Of Pseudo Random Bits (1982) (10)
Tape Reversal Complexity Hierarchies (1968) (9)
Towards a computational theory of statistical tests (1992) (9)
Reducibility Among Protocols (1983) (8)
AFTER‐DINNER ADDRESS: THE FUN OF FAILURES * (1969) (7)
Two papers on the selection problem: Time Bounds for Selection [by Manual Blum, Robert W. Floyd, Vaughan Pratt, Ronald L. Rivest, and Robert E. Tarjan] and Expected Time Bounds for Selection [by Robert W. Floyd and Ronald L. Rivest]. (1973) (7)
A Secure Human-Computer Authentication (2000) (7)
Contributions of theoretical computer science (1995) (5)
Evaluating Correctness of Propositions Using the Web (2011) (4)
Designing programs to check their work (abstract) (1993) (4)
On effective procedures for speeding up algorithms (1969) (4)
Program Checking (1991) (3)
Towards a Computational Theory of Statistical Tests (Extended Abstract) (1992) (3)
Inductive Inference of Integer Sequences (2010) (3)
Universal Statistical Tests (1992) (2)
Applying Computational Complexity Theory and Cryptography to the Pursuit of Concept Understanding : An Overview of Current Work (2006) (1)
Non-monotone Behaviors in MIN / MAX / AVG Circuits and their Relationship to Simple Stochastic Games ∗ (2006) (1)
Cybernetics: A mathematician of mind (2016) (1)
Utilizing the Power of Human Cycles (2006) (1)
Self-Correcting for Function Fields Transcendental Degree (1995) (1)
A Theoretical Computer Science Perspective on Free Will (2022) (1)
Mathematical Foundations for Understanding and Designing Conceptualizing Strategizing Control ( CONSCS ) Systems (2004) (1)
Some programs need only be checked for correctness on random inputs (1998) (1)
Self-correcting programs and error-correcting codes (1997) (0)
Human Computation with an Application to Passwords (2017) (0)
Senior Thesis 2006 Covert Multi-Party Computation (2006) (0)
Understanding and Inductive Inference (2010) (0)
Human-Usable Password Schemas: Beyond Information-Theoretic Security (2019) (0)
Transitive Transfer of Conndence: a Per- Fect Zero-knowledge Interactive Proto- Col for Sat and Beyond. 5.1 Additional Security for the User (1997) (0)
Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract) (1997) (0)
Augmented Integer Linear Recurrences (0)
Senior Research Thesis Extended Abstract Direct Zero-Knowledge Proofs (2009) (0)
The Origins of Computational Complexity Some influences of (2014) (0)
CAPTCHA Cracker using MATLAB (2016) (0)
Securing Images in Cloud using Hyper Chaos with User Authentication (2016) (0)

This paper list is powered by the following services:

Other Resources About Manuel Blum

What Schools Are Affiliated With Manuel Blum?

Manuel Blum is affiliated with the following schools:

Manuel Blum's Academic­Influence.com Rankings

Manuel Blum's Degrees

Why Is Manuel Blum Influential?

Manuel Blum's Published Works

Published Works

Other Resources About Manuel Blum

What Schools Are Affiliated With Manuel Blum?

Manuel Blum's AcademicInfluence.com Rankings