default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCalvin C. Elgot
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1982
[b1]Calvin C. Elgot, Stephen L. Bloom:
Selected papers. Springer 1982, ISBN 978-3-540-90698-8, pp. I-XXIV, 1-460- [j16]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
- [j15]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) - [j14]Stephen L. Bloom, Calvin C. Elgot, Jesse B. Wright:
Vector Iteration in Pointed Iterative Theories. SIAM J. Comput. 9(3): 525-540 (1980)
1970 – 1979
- 1979
- [j13]Calvin C. Elgot, John C. Shepherdson:
A Semantically Meaningful Characterization of Reducible Flowchart Schemes. Theor. Comput. Sci. 8: 325-357 (1979) - 1978
- [j12]Calvin C. Elgot, Stephen L. Bloom, Ralph Tindell:
On the Algebraic Atructure of Rooted Trees. J. Comput. Syst. Sci. 16(3): 362-399 (1978) - [c8]Calvin C. Elgot:
A representative strong equivalence class for accessible flowchart schemes. Mathematical Studies of Information Processing 1978: 559-575 - 1977
- [j11]Calvin C. Elgot, Lawrence Snyder:
On the Many Facets of Lists. Theor. Comput. Sci. 5(3): 275-305 (1977) - [c7]Calvin C. Elgot:
Some "Geometrical" Categories Associated with Flowchart Schemes. FCT 1977: 256-259 - [c6]Calvin C. Elgot:
Finite Automaton from a Flowchart Scheme Point of View. MFCS 1977: 44-51 - 1976
- [j10]Stephen L. Bloom, Calvin C. Elgot:
The Existence and Construction of Free Iterative Theories. J. Comput. Syst. Sci. 12(3): 305-318 (1976) - [j9]Calvin C. Elgot:
Structured Programming With and Without GO TO Statements. IEEE Trans. Software Eng. 2(1): 41-54 (1976) - [j8]Calvin C. Elgot:
Erratum and Corrigendum for "Structured Programming With and Without GO TO Statments". IEEE Trans. Software Eng. 2(3): 232 (1976) - 1971
- [p1]Calvin C. Elgot:
Algebraic theories and program schemes. Symposium on Semantics of Algorithmic Languages 1971: 71-88 - 1970
- [j7]Calvin C. Elgot:
The common algebraic structure of exit-automata and machines. Computing 6(3-4): 349-370 (1970)
1960 – 1969
- 1966
- [j6]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) - 1965
- [j5]Calvin C. Elgot, Jorge E. Mezei:
On Relations Defined by Generalized Finite Automata. IBM J. Res. Dev. 9(1): 47-68 (1965) - 1964
- [j4]Calvin C. Elgot, Joseph D. Rutledge:
RS -Machines with Almost Blank Tape. J. ACM 11(3): 313-337 (1964) - [j3]Calvin C. Elgot, Abraham Robinson:
Random-Access Stored-Program Machines, an Approach to Programming Languages. J. ACM 11(4): 365-399 (1964) - 1963
- [c5]Calvin C. Elgot, Jorge E. Mezei:
Two-sided finite-state transductions (abbreviated version). SWCT 1963: 17-22 - 1962
- [c4]Calvin C. Elgot, Joseph D. Rutledge:
Machine properties preserved under state minimization. SWCT 1962: 61-70 - 1961
- [c3]Calvin C. Elgot, Joseph D. Rutledge:
Operations of finite automata. SWCT 1961: 129-132 - [c2]Calvin C. Elgot, Saburo Muroga:
Two problems on threshold functions. SWCT 1961: 166 - 1960
- [c1]Calvin C. Elgot:
Truth functions realizable by single threshold organs. SWCT 1960: 225-245
1950 – 1959
- 1958
- [j2]Irving M. Copi, Calvin C. Elgot, Jesse B. Wright:
Realization of Events by Logical Nets. J. ACM 5(2): 181-196 (1958) - 1954
- [j1]Calvin C. Elgot:
On Single vs. Triple Address Computing Machines. J. ACM 1(3): 119-123 (1954)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-30 21:40 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
