Skip to main content

Box 9

 Container

Contains 88 Results:

Computational Complexity of Random Access Stored Program Machines, 1971

 unspecified — Box: 9, Folder: 21
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1971
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

An Overview of the Theory of Computational Complexity, 1971

 unspecified — Box: 9, Folder: 22
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1971
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

Group Theoretic Characterization of Linear Permutation Automata, 1973

 unspecified — Box: 9, Folder: 23
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1973
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

Computational Complexity of Formal Translations, 1974

 unspecified — Box: 9, Folder: 24
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1974
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

The LBA Problem and Its Importance in the Theory of Computing, 1974

 unspecified — Box: 9, Folder: 25
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1974
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

A Note on Tape Bounds for SLA Language Processing, 1975

 unspecified — Box: 9, Folder: 26
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1975
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

On Simple Goedel Numberings and Translations, 1975

 unspecified — Box: 9, Folder: 27
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1975
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

On Tape Bounds for Single Letter Alphabet Language Processing, 1976

 unspecified — Box: 9, Folder: 28
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1976
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

Generalized Kolmogorov Complexity and the Structure of Feasible Computations, 1976

 unspecified — Box: 9, Folder: 29
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1976
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

On the Structure of Feasible Computations, 1976

 unspecified — Box: 9, Folder: 30
COLLECTION DESCRIPTION From the Collection:

Includes publications by Hartmanis and others in the field of computer science, correspondence, and subject files.

Dates: 1976
Found in: Division of Rare and Manuscript Collections / 16-13-3786, Juris Hartmanis papers / Series II. Reprints - Hartmanis

Staff Interface | Visit ArchivesSpace.org | v3.3.1 | Send Feedback or Report a Problem