Automata on a 2-Dimensional Tape - Manuel Blum 001; Carl Hewitt (SWAT, 1967)

A Machine-Independent Theory of the Complexity of Recursive Functions. - Manuel Blum 001 (J. ACM, 1967)

On the Size of Machines - Manuel Blum 001 (Inf. Control., 1967)

Tape Reversal Complexity Hierarchies - Patrick C. Fischer; Juris Hartmanis; Manuel Blum 001 (SWAT, 1968)

On Effective Procedures for Speeding Up Algorithms. - Manuel Blum 001 (J. ACM, 1971)

Linear Time Bounds for Median Computations - Manuel Blum 001; Robert W. Floyd; Vaughan R. Pratt; Ronald L. Rivest; Robert Endre Tarjan (STOC, 1972)

Inductive Inference: A Recursion Theoretic Approach - Lenore Blum; Manuel Blum 001 (SWAT, 1973)

Time Bounds for Selection. - Manuel Blum 001; Robert W. Floyd; Vaughan R. Pratt; Ronald L. Rivest; Robert Endre Tarjan (J. Comput. Syst. Sci., 1973)

On Complexity Properties of Recursively Enumerable Sets. - Manuel Blum 001; Ivan Marques (J. Symb. Log., 1973)

On Almost Everywhere Complex Recursive Functions. - John Gill; Manuel Blum 001 (J. ACM, 1974)

Toward a Mathematical Theory of Inductive Inference - Lenore Blum; Manuel Blum 001 (Inf. Control., 1975)

On the Capability of Finite Automata in 2 and 3 Dimensional Space - Manuel Blum 001; William J. Sakoda (FOCS, 1977)

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

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

Coin Flipping by Telephone. - Manuel Blum 001 (CRYPTO, 1981)

The Complexity of Testing Whether a Graph is a Superconcentrator. - Manuel Blum 001; Richard M. Karp; Oliver Vornberger; Christos H. Papadimitriou; Mihalis Yannakakis (Inf. Process. Lett., 1981)

Comparison of Two Pseudo-Random Number Generators. - Lenore Blum; Manuel Blum 001; Mike Shub (CRYPTO, 1982)

Reducibility Among Protocols. - Manuel Blum 001; Umesh V. Vazirani; Vijay V. Vazirani (CRYPTO, 1983)

How to Exchange (Secret) Keys (Extended Abstract) - Manuel Blum 001 (STOC, 1983)

Coin flipping by telephone a protocol for solving impossible problems. - Manuel Blum 001 (SIGACT News, 1983)

How to Exchange (Secret) Keys - Manuel Blum 001 (ACM Trans. Comput. Syst., 1983)

An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information. - Manuel Blum 001; Shafi Goldwasser (CRYPTO, 1984)

Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain - Manuel Blum 001 (FOCS, 1984)

How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. - Manuel Blum 001; Silvio Micali (SIAM J. Comput., 1984)

Independent unbiased coin flips from a correlated biased source-a finite stae Markov chain. - Manuel Blum 001 (Comb., 1986)

A Simple Unpredictable Pseudo-Random Number Generator. - Lenore Blum; Manuel Blum 001; Mike Shub (SIAM J. Comput., 1986)

Generic Oracles and Oracle Classes (Extended Abstract) - Manuel Blum 001; Russell Impagliazzo (FOCS, 1987)

Proving Security Against Chosen Cyphertext Attacks. - Manuel Blum 001; Paul Feldman; Silvio Micali (CRYPTO, 1988)

Non-Interactive Zero-Knowledge and Its Applications (Extended Abstract) - Manuel Blum 001; Paul Feldman; Silvio Micali (STOC, 1988)

Program Result Checking against Adaptive Programs and in Cryptographic Settings. - Manuel Blum 001; Michael Luby; Ronitt Rubinfeld (Distributed Computing And Cryptography, 1989)

Program Correctness: Can One Test For It? - Manuel Blum 001; Prabhakar Raghavan (IFIP Congress, 1989)

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

Program Checking. - Manuel Blum 001 (FSTTCS, 1991)

Inductive Inference and Unsolvability. - Leonard M. Adleman; Manuel Blum 001 (J. Symb. Log., 1991)

Noninteractive Zero-Knowledge. - Manuel Blum 001; Alfredo De Santis; Silvio Micali; Giuseppe Persiano (SIAM J. Comput., 1991)

Towards a Computational Theory of Statistical Tests (Extended Abstract) - Manuel Blum 001; Oded Goldreich 001 (FOCS, 1992)

Universal Statistical Tests. - Manuel Blum 001 (LATIN, 1992)

Program Result Checking: A New Approach to Making Programs More Reliable. - Manuel Blum 001 (ICALP, 1993)

Designing Programs to Check Their Work (Abstract). - Manuel Blum 001 (ISSTA, 1993)

Checking approximate computations over the reals. - Sigal Ar; Manuel Blum 001; Bruno Codenotti; Peter Gemmell (STOC, 1993)

Self-Testing/Correcting with Applications to Numerical Problems. - Manuel Blum 001; Michael Luby; Ronitt Rubinfeld (J. Comput. Syst. Sci., 1993)

Program Result-Checking: A Theory of Testing Meets a Test of Theory - Manuel Blum 001; Hal Wasserman (FOCS, 1994)

Matching Nuts and Bolts. - Noga Alon; Manuel Blum 001; Amos Fiat; Sampath Kannan; Moni Naor; Rafail Ostrovsky (SODA, 1994)

Checking the Correctness of Memories. - Manuel Blum 001; William S. Evans; Peter Gemmell; Sampath Kannan; Moni Naor (Algorithmica, 1994)

Self-Correcting for Function Fields Transcendental Degree. - Manuel Blum 001; Bruno Codenotti; Peter Gemmell; Troy Shahoumian (ICALP, 1995)

on the Problem of Sorting Burnt Pancakes. - David S. Cohen; Manuel Blum 001 (Discret. Appl. Math., 1995)

Designing Programs that Check Their Work. - Manuel Blum 001; Sampath Kannan (J. ACM, 1995)

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

Reflections on the Pentium Bug. - Manuel Blum 001; Hal Wasserman (IEEE Trans. Computers, 1996)

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

Software reliability via run-time result-checking. - Hal Wasserman; Manuel Blum 001 (J. ACM, 1997)

Secure Human Identification Protocols. - Nicholas J. Hopper; Manuel Blum 001 (ASIACRYPT, 2001)

CAPTCHA: Using Hard AI Problems for Security. - Luis von Ahn; Manuel Blum 001; Nicholas J. Hopper; John Langford 001 (EUROCRYPT, 2003)

Telling humans and computers apart automatically. - Luis von Ahn; Manuel Blum 001; John Langford 001 (Commun. ACM, 2004)

Improving accessibility of the web with a computer game. - Luis von Ahn; Shiry Ginosar; Mihir Kedia; Ruoran Liu; Manuel Blum 001 (CHI, 2006)

Verbosity: a game for collecting common-sense facts. - Luis von Ahn; Mihir Kedia; Manuel Blum 001 (CHI, 2006)

Peekaboom: a game for locating objects in images. - Luis von Ahn; Ruoran Liu; Manuel Blum 001 (CHI, 2006)

Improving Image Search with PHETCH. - Luis von Ahn; Shiry Ginosar; Mihir Kedia; Manuel Blum 001 (ICASSP (4), 2007)

Understanding and Inductive Inference. - Manuel Blum 001 (COCOON, 2010)

GOTCHA password hackers! - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (AISec, 2013)

Human Computable Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (CoRR, 2014)

Publishable Humanly Usable Secure Password Creation Schemas. - Manuel Blum 001; Santosh Srinivas Vempala (HCOMP, 2015)

Naturally Rehearsing Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta (IACR Cryptol. ePrint Arch., 2015)

Cybernetics: A mathematician of mind. - Manuel Blum 001 (Nat., 2016)

Towards Human Computable Passwords. - Jeremiah Blocki; Manuel Blum 001; Anupam Datta; Santosh S. Vempala (ITCS, 2017)

The Complexity of Human Computation: A Concrete Model with an Application to Passwords. - Manuel Blum 001; Santosh S. Vempala (CoRR, 2017)

Non-interactive zero-knowledge and its applications. - Manuel Blum 001; Paul Feldman; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

How to generate cryptographically strong sequences of pseudo random bits. - Manuel Blum 001; Silvio Micali (Providing Sound Foundations for Cryptography, 2019)

Human-Usable Password Schemas: Beyond Information-Theoretic Security. - Elan Rosenfeld; Santosh S. Vempala; Manuel Blum 001 (CoRR, 2019)

The complexity of human computation via a concrete model with an application to passwords. - Manuel Blum 001; Santosh S. Vempala (Proc. Natl. Acad. Sci. USA, 2020)

A Theory of Consciousness from a Theoretical Computer Science Perspective: Insights from the Conscious Turing Machine. - Lenore Blum; Manuel Blum 001 (CoRR, 2021)

A Theoretical Computer Science Perspective on Consciousness. - Manuel Blum 001; Lenore Blum (J. Artif. Intell. Conscious., 2021)

A Theoretical Computer Science Perspective on Free Will. - Lenore Blum; Manuel Blum 001 (CoRR, 2022)

Viewpoint: A Theoretical Computer Science Perspective on Consciousness and Artificial General Intelligence. - Lenore Blum; Manuel Blum 001 (CoRR, 2023)

AI Consciousness is Inevitable: A Theoretical Computer Science Perspective. - Lenore Blum; Manuel Blum 001 (CoRR, 2024)