# Ph.D. Dissertations - Manuel Blum

Some Programs Need Only Be Checked for Correctness on Random Inputs

Troy A. Shahoumian [1998]

Self-Correcting Programs and Error-Correcting Codes

Hal Wasserman [1997]

Network Analysis Without Exponentiality Assumptions

Mor Harchol-Balter [1996]

A 2 1/2 Approximation in Algorithm for Shortest Common Superstring

Elizabeth A. Sweedyk [1995]

Random Walks on Colored Graphs: Analysis and Applications

Diane Hernek [1995]

Information Theory and Noisy Computation

William S. Evans [1994]

Extensions of Result Checking and Authentication

Peter S. Gemmell [1993]

A Mathematical Theory of Self-Checking, Self-Testing and Self-Correcting Programs

Ronitt A. Rubinfeld [1990]

Program Checkers for Algebraic Problems

Sampath K. Kannan [1990]

Implicit Storage Schemes for Quick Retrieval

Simeon Naor [1989]

Limits on the Provable Consequences of One-way Functions

Steven Rudich [1988]

Reversing Trains: A Turn of the Century Sorting Problem

Nancy M. Amato [1988]

Randomness, Adversaries and Computation

Umesh V. Vazirani [1986]

Three Results in Number Theory and Cryptography: 1. A New Algorithm to Compute Square Roots Modulo A Prime Number. 2. On the Bit Complexity of the Discrete Logarithm. 3. A Framework for the Study of Cryptoprotocols

René C. Peralta [1985]

Analytic Methods in the Analysis and Design of Number-Theoretic Algorithms

C. Eric Bach [1984]

Maximum Matchings Without Blossoms

Vijay V. Vazirani [1984]

Inferring Sequences Produced by Pseudo-Random Number Generators

Joan B. Plumstead [1983]

Probabilistic Encryption: Theory and Applications

Shafrira Goldwasser [1984]

Randomness Versus Hardness

Silvio Micali [1983]

Nondeterminism and the Size of Two-Way Finite Automata

Michael F. Sipser [1980]

Applications of Automata Theory to the Design of Intelligent Machines

William J. Sakoda [1978]

I. On Shortest Program for Finite Strings. II. A New Solution of the Critical Section Problem

Howard P. Katseff [1978]

An Application of the Theory of Computational Complexity to the Study of Inductive Inference

Dana C. Angluin [1976]

Number-Theoretic Aspects of Computational Complexity

Leonard M. Adleman [1976]

Complexity Properties of Recursively-Enumerable Sets

Ivan da Costa Marques [1973]

On the Structure of Complexity Measures

Tsun S. Chow [1972]

Some Topics in Computational-Complexity

Andy N.-C. Kang [1972]

The Primitive Recursive-Permutations Generate the Group of Recursive-Permutations

Ion S. Filotti [1972]