default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur Gill
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1980 – 1989
- 1987
[b1]Arthur Gill, Edward M. Corwin, Antonette M. Logar:
Assembly language programming for the 68000. Prentice Hall 1987, ISBN 978-0-13-049827-4, pp. I-VIII, 1-248- 1980
- [j27]Arthur Gill:
Hierarchical Binary Search. Commun. ACM 23(5): 294-300 (1980)
1970 – 1979
- 1979
- [j26]Paulo A. S. Veloso, Arthur Gill:
Some Remarks on Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 18(3): 304-306 (1979) - 1976
- [j25]Mario Magidin, Arthur Gill:
Singular Shift Registers Over Residue Class Rings. Math. Syst. Theory 9(4): 345-358 (1976) - 1974
- [j24]Arthur Gill, Doron Gottlieb:
The Identification of a Set by Successive Intersections. Inf. Control. 24(1): 20-35 (1974) - [j23]Arthur Gill, Lawrence T. Kou:
Multiple-Entry Finite Automata. J. Comput. Syst. Sci. 9(1): 1-19 (1974) - 1970
- [j22]S. K. Chang, Arthur Gill:
Algorithm 397: An integer programming problem. Commun. ACM 13(10): 620 (1970) - [j21]S. K. Chang, Arthur Gill:
Algorithmic Solution of the Change-Making Problem. J. ACM 17(1): 113-122 (1970) - [j20]Arthur Gill:
Single-Channel and Multichannel Finite-State Machines. IEEE Trans. Computers 19(11): 1073-1078 (1970)
1960 – 1969
- 1968
- [j19]Irving L. Traiger, Arthur Gill:
On an Asymptotic Optimization Problem in Finite, Directed, Weighted Graphs. Inf. Control. 13(6): 527-533 (1968) - 1967
- [j18]Arthur Gill, J. Robert Flexer:
Periodic Decomposition of Sequential Machines. J. ACM 14(4): 666-676 (1967) - 1966
- [j17]Arthur Gill:
Realization of Input-Output Relations by Sequential Machines. J. ACM 13(1): 33-42 (1966) - [j16]Arthur Gill:
On the Series-to-Parallel Transformation of Linear Sequential Circuits. IEEE Trans. Electron. Comput. 15(1): 107-108 (1966) - [c1]Arthur Gill:
Graphs of Affine Transformations, with Applications to Sequential Circuits. SWAT 1966: 127-135 - 1965
- [j15]Arthur Gill:
Analysis and Synthesis of Stable Linear Sequential Circuits. J. ACM 12(1): 141-149 (1965) - [j14]Arthur Gill:
On the Bound to the Memory of a Sequential Machine. IEEE Trans. Electron. Comput. 14(3): 464-466 (1965) - 1964
- [j13]Arthur Gill:
Analysis of Linear Sequential Circuits by Confluence Sets. IEEE Trans. Electron. Comput. 13(3): 226-231 (1964) - 1963
- [j12]Arthur Gill:
On a Weight Distribution Problem, with Application to the Design of Stochastic Generators. J. ACM 10(1): 110-121 (1963) - 1962
- [j11]Arthur Gill:
A theorem concerning compact and cyclic sequences (Corresp.). IRE Trans. Inf. Theory 8(3): 255 (1962) - 1961
- [j10]Arthur Gill:
Sate-Identification Experiments in Finite Automata. Inf. Control. 4(2-3): 132-154 (1961) - [j9]Arthur Gill:
A Note on Moore's Distinguishability Theorem. IRE Trans. Electron. Comput. 10(2): 290-291 (1961) - [j8]Arthur Gill:
Cascaded Finite-State Machines. IRE Trans. Electron. Comput. 10(3): 366-370 (1961) - [j7]Arthur Gill:
Part 3: Pattern Recognition. IRE Trans. Inf. Theory 7(3): 133-135 (1961) - 1960
- [j6]Arthur Gill:
Analysis of Nets by Numerical Methods. J. ACM 7(3): 251-254 (1960) - [j5]Arthur Gill:
The Optimal Organization of Serial Memory Transfers. IRE Trans. Electron. Comput. 9(1): 12-15 (1960) - [j4]Arthur Gill:
Minimization of Contact Networks Subject to Relibility Specifications. IRE Trans. Electron. Comput. 9(1): 122-123 (1960) - [j3]Arthur Gill:
Characterizing Experiments for Finite-Memory Binary Automata. IRE Trans. Electron. Comput. 9(4): 469-471 (1960)
1950 – 1959
- 1959
- [j2]Arthur Gill:
Systematic Scaling for Digital Differential Analyzers. IRE Trans. Electron. Comput. 8(4): 486-489 (1959) - [j1]Arthur Gill:
Minimum-scan pattern recognition. IRE Trans. Inf. Theory 5(2): 52-58 (1959)
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 2025-01-21 00:20 CET 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:
