| 1982 |
|---|
| 22 | | Calvin C. Elgot,
Alan J. Perlis,
Lawrence Snyder:
A Syntax-Free Semantics for the APL Operators.
Inf. Process. Lett. 14(3): 128-131 (1982) |
| 1980 |
|---|
| 21 | | Stephen L. Bloom,
Calvin C. Elgot,
Jesse B. Wright:
Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation.
SIAM J. Comput. 9(1): 25-45 (1980) |
| 20 | | Stephen L. Bloom,
Calvin C. Elgot,
Jesse B. Wright:
Vector Iteration in Pointed Iterative Theories.
SIAM J. Comput. 9(3): 525-540 (1980) |
| 1979 |
|---|
| 19 | | Calvin C. Elgot,
John C. Shepherdson:
A Semantically Meaningful Characterization of Reducible Flowchart Schemes.
Theor. Comput. Sci. 8: 325-357 (1979) |
| 1978 |
|---|
| 18 | | Calvin C. Elgot:
A representative strong equivalence class for accessible flowchart schemes.
Mathematical Studies of Information Processing 1978: 559-575 |
| 17 | | Calvin C. Elgot,
Stephen L. Bloom,
Ralph Tindell:
On the Algebraic Atructure of Rooted Trees.
J. Comput. Syst. Sci. 16(3): 362-399 (1978) |
| 1977 |
|---|
| 16 | | Calvin C. Elgot:
Some ``Geometrical'' Categories Associated with Flowchart Schemes.
FCT 1977: 256-259 |
| 15 | | Calvin C. Elgot:
Finite Automaton from a Flowchart Scheme Point of View.
MFCS 1977: 44-51 |
| 14 | | Calvin C. Elgot,
Lawrence Snyder:
On the Many Facets of Lists.
Theor. Comput. Sci. 5(3): 275-305 (1977) |
| 1976 |
|---|
| 13 | | Calvin C. Elgot:
Structured Programming With and Without GO TO Statements.
IEEE Trans. Software Eng. 2(1): 41-54 (1976) |
| 12 | | Calvin C. Elgot:
Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments".
IEEE Trans. Software Eng. 2(3): 232 (1976) |
| 11 | | Stephen L. Bloom,
Calvin C. Elgot:
The Existence and Construction of Free Iterative Theories.
J. Comput. Syst. Sci. 12(3): 305-318 (1976) |
| 1966 |
|---|
| 10 | | Calvin C. Elgot,
Michael O. Rabin:
Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor.
J. Symb. Log. 31(2): 169-181 (1966) |
| 1964 |
|---|
| 9 | EE | Calvin C. Elgot,
Joseph D. Rutledge:
RS -Machines with Almost Blank Tape.
J. ACM 11(3): 313-337 (1964) |
| 8 | EE | Calvin C. Elgot,
Abraham Robinson:
Random-Access Stored-Program Machines, an Approach to Programming Languages.
J. ACM 11(4): 365-399 (1964) |
| 1963 |
|---|
| 7 | | Calvin C. Elgot,
Jorge E. Mezei:
Two-sided finite-state transductions (abbreviated version)
FOCS 1963: 17-22 |
| 1962 |
|---|
| 6 | | Calvin C. Elgot,
Joseph D. Rutledge:
Machine properties preserved under state minimization
FOCS 1962: 61-70 |
| 1961 |
|---|
| 5 | | Calvin C. Elgot,
Joseph D. Rutledge:
Operations of finite automata
FOCS 1961: 129-132 |
| 4 | | Calvin C. Elgot,
Saburo Muroga:
Two problems on threshold functions
FOCS 1961: 166 |
| 1960 |
|---|
| 3 | | Calvin C. Elgot:
Truth functions realizable by single threshold organs
FOCS 1960: 225-245 |
| 1958 |
|---|
| 2 | EE | Irving M. Copi,
Calvin C. Elgot,
Jesse B. Wright:
Realization of Events by Logical Nets.
J. ACM 5(2): 181-196 (1958) |
| 1954 |
|---|
| 1 | EE | Calvin C. Elgot:
On Single vs. Triple Address Computing Machines
J. ACM 1(3): 119-123 (1954) |
