Thomas N. Hibbard

Publication Activity (10 Years)

Years Active: 1961-2009
Publications (10 Years): 0

Publications

Thomas N. Hibbard, Camilo Jadur, Jorge Yazlle
An algorithm for testing permutativeness of cellular automata. Adv. Appl. Math. 43 (4) (2009)
Armin B. Cremers, Thomas N. Hibbard
Axioms for Concurrent Processes. New Results and New Trends in Computer Science (1991)
Armin B. Cremers, Thomas N. Hibbard
Applicative State Transition Systems in LISP-Like Notation. GI Jahrestagung (1983)
Armin B. Cremers, Thomas N. Hibbard
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report). ICALP (1979)
Armin B. Cremers, Thomas N. Hibbard
Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract). ICALP (1978)
Armin B. Cremers, Thomas N. Hibbard
Orthogonality of Information Structures. Acta Informatica 9 (1978)
Armin B. Cremers, Thomas N. Hibbard
Functional Behavior in Data Spaces. Acta Informatica 9 (1978)
Armin B. Cremers, Thomas N. Hibbard
Data Spaces with Indirect Addressing. Math. Syst. Theory 12 (1978)
Armin B. Cremers, Thomas N. Hibbard
Formal Modeling of Virtual Machines. IEEE Trans. Software Eng. 4 (5) (1978)
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) (1977)
Armin B. Cremers, Thomas N. Hibbard
The Semantical Definition of Programming Languages in Terms of Their Data Spaces. Fachtagung über Programmiersprachen (1976)
Armin B. Cremers, Thomas N. Hibbard
On the Relationship between a Procedure and its Data. MFCS (1976)
Thomas N. Hibbard
Context-Limited Grammars. J. ACM 21 (3) (1974)
Thomas N. Hibbard
A Generalization of Context-Free Determinism Inf. Control. 11 (1/2) (1967)
Thomas N. Hibbard, Joseph S. Ullian
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages. J. ACM 13 (4) (1966)
Seymour Ginsburg, Thomas N. Hibbard
Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11 (3) (1964)
Thomas N. Hibbard
A Simple Sorting Algorithm. J. ACM 10 (2) (1963)
Thomas N. Hibbard
An empirical study of minimal storage sorting. Commun. ACM 6 (5) (1963)
Thomas N. Hibbard
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting. J. ACM 9 (1) (1962)
Thomas N. Hibbard
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines. J. ACM 8 (4) (1961)
Thomas N. Hibbard
Theory of programmed processes. Commun. ACM 4 (4) (1961)