Manuel Blum

According to our database1, Manuel Blum
  • authored at least 74 papers between 1967 and 2017.
  • has a "Dijkstra number"2 of three.

Awards

Turing Prize recipient

Turing Prize 1995, "In recognition of his contributions to the foundations of computational complexity theory and its application to cryptography and program verification|program checking.".

IEEE Fellow

IEEE Fellow 1983, "For fundamental contributions to the abstract theory of computational complexity".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
The Complexity of Human Computation: A Concrete Model with an Application to Passwords.
CoRR, 2017

Towards Human Computable Passwords.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
Cybernetics: A mathematician of mind.
Nature, 2016

2015
Naturally Rehearsing Passwords.
IACR Cryptology ePrint Archive, 2015

Publishable Humanly Usable Secure Password Creation Schemas.
Proceedings of the Third AAAI Conference on Human Computation and Crowdsourcing, 2015

2014
Human Computable Passwords.
CoRR, 2014

2013
Naturally Rehearsing Passwords
CoRR, 2013

GOTCHA Password Hackers!
CoRR, 2013

GOTCHA password hackers!
Proceedings of the AISec'13, 2013

Naturally Rehearsing Passwords.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2010
Understanding and Inductive Inference.
Proceedings of the Computing and Combinatorics, 16th Annual International Conference, 2010

2007
Improving Image Search with PHETCH.
Proceedings of the IEEE International Conference on Acoustics, 2007

2006
Peekaboom: a game for locating objects in images.
Proceedings of the 2006 Conference on Human Factors in Computing Systems, 2006

Verbosity: a game for collecting common-sense facts.
Proceedings of the 2006 Conference on Human Factors in Computing Systems, 2006

Improving accessibility of the web with a computer game.
Proceedings of the 2006 Conference on Human Factors in Computing Systems, 2006

2004
Telling humans and computers apart automatically.
Commun. ACM, 2004

2003
CAPTCHA: Using Hard AI Problems for Security.
Proceedings of the Advances in Cryptology, 2003

2001
Secure Human Identification Protocols.
Proceedings of the Advances in Cryptology, 2001

1997
Software reliability via run-time result-checking.
J. ACM, 1997

Program Error Detection/Correction: Turning PAC Learning into PERFECT Learning (Abstract).
Proceedings of the Algorithmic Learning Theory, 8th International Conference, 1997

1996
Reflections on the Pentium Bug.
IEEE Trans. Computers, 1996

1995
Contributions of theoretical computer science.
SIGACT News, 1995

Designing Programs that Check Their Work.
J. ACM, 1995

on the Problem of Sorting Burnt Pancakes.
Discrete Applied Mathematics, 1995

Self-Correcting for Function Fields Transcendental Degree.
Proceedings of the Automata, Languages and Programming, 22nd International Colloquium, 1995

1994
Checking the Correctness of Memories.
Algorithmica, 1994

Matching Nuts and Bolts.
Proceedings of the Fifth Annual ACM-SIAM Symposium on Discrete Algorithms. 23-25 January 1994, 1994

Program Result-Checking: A Theory of Testing Meets a Test of Theory
Proceedings of the 35th Annual Symposium on Foundations of Computer Science, 1994

1993
Self-Testing/Correcting with Applications to Numerical Problems.
J. Comput. Syst. Sci., 1993

Checking approximate computations over the reals.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Designing Programs to Check Their Work (Abstract).
Proceedings of the 1993 International Symposium on Software Testing and Analysis, 1993

Program Result Checking: A New Approach to Making Programs More Reliable.
Proceedings of the Automata, Languages and Programming, 20nd International Colloquium, 1993

1992
Universal Statistical Tests.
Proceedings of the LATIN '92, 1992

Towards a Computational Theory of Statistical Tests (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Noninteractive Zero-Knowledge.
SIAM J. Comput., 1991

Inductive Inference and Unsolvability.
J. Symb. Log., 1991

Program Checking.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1991

Checking the Correctness of Memories
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Self-Testing/Correcting with Applications to Numerical Problems
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Reversing Trains: A Turn of the Century Sorting Problem.
J. Algorithms, 1989

Designing Programs That Check Their Work
Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

Program Correctness: Can One Test For It?
IFIP Congress, 1989

Program Result Checking against Adaptive Programs and in Cryptographic Settings.
Proceedings of the Distributed Computing And Cryptography, 1989

1988
Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Proving Security Against Chosen Cyphertext Attacks.
Proceedings of the Advances in Cryptology, 1988

1987
Generic Oracles and Oracle Classes (Extended Abstract)
Proceedings of the 28th Annual Symposium on Foundations of Computer Science, 1987

1986
A Simple Unpredictable Pseudo-Random Number Generator.
SIAM J. Comput., 1986

Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain.
Combinatorica, 1986

1984
How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits.
SIAM J. Comput., 1984

Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information.
Proceedings of the Advances in Cryptology, 1984

1983
How to Exchange (Secret) Keys
ACM Trans. Comput. Syst., 1983

How to Exchange (Secret) Keys (Extended Abstract)
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Reducibility Among Protocols.
Proceedings of the Advances in Cryptology, 1983

1982
How to Generate Cryptographically Strong Sequences of Pseudo Random Bits
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Comparison of Two Pseudo-Random Number Generators.
Proceedings of the Advances in Cryptology: Proceedings of CRYPTO '82, 1982

Coin Flipping by Telephone - A Protocol for Solving Impossible Problems.
Proceedings of the COMPCON'82, 1982

1981
The Complexity of Testing Whether a Graph is a Superconcentrator.
Inf. Process. Lett., 1981

Coin Flipping by Telephone.
Proceedings of the Advances in Cryptology: A Report on CRYPTO 81, 1981

1980
Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time.
Inf. Process. Lett., 1980

1978
On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs)
Proceedings of the 19th Annual Symposium on Foundations of Computer Science, 1978

1977
On the Capability of Finite Automata in 2 and 3 Dimensional Space
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1975
Toward a Mathematical Theory of Inductive Inference
Information and Control, June, 1975

1974
On Almost Everywhere Complex Recursive Functions.
J. ACM, 1974

1973
On Complexity Properties of Recursively Enumerable Sets.
J. Symb. Log., 1973

Time Bounds for Selection.
J. Comput. Syst. Sci., 1973

Inductive Inference: A Recursion Theoretic Approach
Proceedings of the 14th Annual Symposium on Switching and Automata Theory, 1973

1972
Linear Time Bounds for Median Computations
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971
On Effective Procedures for Speeding Up Algorithms.
J. ACM, 1971

1969
On Effective Procedures for Speeding Up Algorithms
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

1968
Tape Reversal Complexity Hierarchies
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
On the Size of Machines
Information and Control, September, 1967

A Machine-Independent Theory of the Complexity of Recursive Functions.
J. ACM, 1967

Automata on a 2-Dimensional Tape
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967


  Loading...