Computational Complexity of Probabilistic Turing Machines

Information Theory and Reliable Communication

1969 • 3,871 citations

A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations

1952 • 3,575 citations

Computation: Finite and Infinite Machines.

1968 • 2,667 citations

Theory of Recursive Functions and Effective Computability

1969 • 2,654 citations

ERROR CORRECTING CODES

1971 • 1,441 citations

The polynomial-time hierarchy

1976 • 1,332 citations

Formal Languages and their Relation to Automata

1970 • 964 citations

A Machine-Independent Theory of the Complexity of Recursive Functions

1967 • 834 citations

A Fast Monte-Carlo Test for Primality

1977 • 648 citations

Probabilistic automata

1963 • 609 citations

Introduction to probabilistic automata

1972 • 406 citations

Gödel numberings of partial recursive functions

1958 • 273 citations

One-tape, off-line Turing machine computations

1965 • 227 citations

On a combinatorial conjecture of Erdös

1966 • 169 citations

Real time computation

1963 • 127 citations

Computability by Probabilistic Machines

1956 • 70 citations

Probabilistic Turing machines and computability

1969 • 44 citations

Computability by probabilistic Turing machines

1971 • 32 citations

A Course in Computational Probability and Statistics

1971 • 22 citations

On problems solvable by successive trials

1975 • 10 citations