On Single vs. Triple Address Computing Machines - Calvin C. Elgot (J. ACM, 1954)

Realization of Events by Logical Nets. - Irving M. Copi; Calvin C. Elgot; Jesse B. Wright (J. ACM, 1958)

Truth functions realizable by single threshold organs - Calvin C. Elgot (SWCT, 1960)

Two problems on threshold functions - Calvin C. Elgot; Saburo Muroga (SWCT, 1961)

Operations of finite automata - Calvin C. Elgot; Joseph D. Rutledge (SWCT, 1961)

Machine properties preserved under state minimization - Calvin C. Elgot; Joseph D. Rutledge (SWCT, 1962)

Two-sided finite-state transductions (abbreviated version) - Calvin C. Elgot; Jorge E. Mezei (SWCT, 1963)

RS -Machines with Almost Blank Tape. - Calvin C. Elgot; Joseph D. Rutledge (J. ACM, 1964)

Random-Access Stored-Program Machines, an Approach to Programming Languages. - Calvin C. Elgot; Abraham Robinson (J. ACM, 1964)

On Relations Defined by Generalized Finite Automata. - Calvin C. Elgot; Jorge E. Mezei (IBM J. Res. Dev., 1965)

Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. - Calvin C. Elgot; Michael O. Rabin (J. Symb. Log., 1966)

The common algebraic structure of exit-automata and machines. - Calvin C. Elgot (Computing, 1970)

Algebraic theories and program schemes. - Calvin C. Elgot (Symposium on Semantics of Algorithmic Languages, 1971)

The Existence and Construction of Free Iterative Theories. - Stephen L. Bloom; Calvin C. Elgot (J. Comput. Syst. Sci., 1976)

Structured Programming With and Without GO TO Statements. - Calvin C. Elgot (IEEE Trans. Software Eng., 1976)

Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments". - Calvin C. Elgot (IEEE Trans. Software Eng., 1976)

Some "Geometrical" Categories Associated with Flowchart Schemes. - Calvin C. Elgot (FCT, 1977)

Finite Automaton from a Flowchart Scheme Point of View. - Calvin C. Elgot (MFCS, 1977)

On the Many Facets of Lists. - Calvin C. Elgot; Lawrence Snyder 001 (Theor. Comput. Sci., 1977)

A representative strong equivalence class for accessible flowchart schemes. - Calvin C. Elgot (Mathematical Studies of Information Processing, 1978)

On the Algebraic Atructure of Rooted Trees. - Calvin C. Elgot; Stephen L. Bloom; Ralph Tindell (J. Comput. Syst. Sci., 1978)

A Semantically Meaningful Characterization of Reducible Flowchart Schemes. - Calvin C. Elgot; John C. Shepherdson (Theor. Comput. Sci., 1979)

Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation. - Stephen L. Bloom; Calvin C. Elgot; Jesse B. Wright (SIAM J. Comput., 1980)

Vector Iteration in Pointed Iterative Theories. - Stephen L. Bloom; Calvin C. Elgot; Jesse B. Wright (SIAM J. Comput., 1980)

Selected papers. - Calvin C. Elgot; Stephen L. Bloom (Springer, 1982)

A Syntax-Free Semantics for the APL Operators. - Calvin C. Elgot; Alan J. Perlis; Lawrence Snyder 001 (Inf. Process. Lett., 1982)