Thomas N. Hibbard

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