Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas N. Hibbard
Person information
- affiliation: National University of Salta, Argentina
- affiliation (former): California Institute of Technology, Jet Propulsion Laboratory, Pasadena, CA, USA
- affiliation (PhD 1966): University of California, Los Angeles, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2009
[j15]Thomas N. Hibbard, Camilo Jadur, Jorge Yazlle:
An algorithm for testing permutativeness of cellular automata. Adv. Appl. Math. 43(4): 323-330 (2009)- 1978
- [j14]Armin B. Cremers, Thomas N. Hibbard:
Orthogonality of Information Structures. Acta Informatica 9: 243-261 (1978) - [j13]Armin B. Cremers, Thomas N. Hibbard:
Functional Behavior in Data Spaces. Acta Informatica 9: 293-307 (1978) - [j12]Armin B. Cremers, Thomas N. Hibbard:
Data Spaces with Indirect Addressing. Math. Syst. Theory 12: 151-173 (1978) - [j11]Armin B. Cremers, Thomas N. Hibbard:
Formal Modeling of Virtual Machines. IEEE Trans. Software Eng. 4(5): 426-436 (1978) - 1977
- [j10]Armin B. Cremers, Thomas N. Hibbard:
On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space. Theor. Comput. Sci. 5(2): 113-128 (1977) - 1974
- [j9]Thomas N. Hibbard:
Context-Limited Grammars. J. ACM 21(3): 446-453 (1974) - 1967
- [j8]Thomas N. Hibbard:
A Generalization of Context-Free Determinism. Inf. Control. 11(1/2): 196-238 (1967) - 1966
- [j7]Thomas N. Hibbard, Joseph S. Ullian:
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages. J. ACM 13(4): 588-593 (1966) - 1964
- [j6]Seymour Ginsburg, Thomas N. Hibbard:
Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11(3): 302-312 (1964) - 1963
- [j5]Thomas N. Hibbard:
An empirical study of minimal storage sorting. Commun. ACM 6(5): 206-213 (1963) - [j4]Thomas N. Hibbard:
A Simple Sorting Algorithm. J. ACM 10(2): 142-150 (1963) - 1962
- [j3]Thomas N. Hibbard:
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting. J. ACM 9(1): 13-28 (1962) - 1961
- [j2]Thomas N. Hibbard:
Theory of programmed processes. Commun. ACM 4(4): 195 (1961) - [j1]Thomas N. Hibbard:
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines. J. ACM 8(4): 601-612 (1961)
Conference and Workshop Papers
- 1991
- [c6]Armin B. Cremers, Thomas N. Hibbard:
Axioms for Concurrent Processes. New Results and New Trends in Computer Science 1991: 54-68 - 1983
- [c5]Armin B. Cremers, Thomas N. Hibbard:
Applicative State Transition Systems in LISP-Like Notation. GI Jahrestagung 1983: 51-66 - 1979
- [c4]Armin B. Cremers, Thomas N. Hibbard:
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report). ICALP 1979: 147-160 - 1978
- [c3]Armin B. Cremers, Thomas N. Hibbard:
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract). ICALP 1978: 165-176 - 1976
- [c2]Armin B. Cremers, Thomas N. Hibbard:
On the Relationship between a Procedure and its Data. MFCS 1976: 250-254 - [c1]Armin B. Cremers, Thomas N. Hibbard:
The Semantical Definition of Programming Languages in Terms of Their Data Spaces. Fachtagung über Programmiersprachen 1976: 1-11
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-05-02 21:49 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:
