# Thomas N. Hibbard

According to our database

Collaborative distances:

^{1}, Thomas N. Hibbard authored at least 21 papers between 1961 and 2009.Collaborative distances:

## Timeline

#### Legend:

Book In proceedings Article PhD thesis Other## Links

#### Homepages:

#### On csauthors.net:

## Bibliography

2009

An algorithm for testing permutativeness of cellular automata.

Adv. Appl. Math., 2009

1991

Axioms for Concurrent Processes.

Proceedings of the New Results and New Trends in Computer Science, 1991

1983

Applicative State Transition Systems in LISP-Like Notation.

Proceedings of the GI - 13. Jahrestagung, Hamburg, 3.-7. Oktober 1983, Proceedings, 1983

1979

Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report).

Proceedings of the Automata, 1979

1978

Formal Modeling of Virtual Machines.

IEEE Trans. Software Eng., 1978

Data Spaces with Indirect Addressing.

Mathematical Systems Theory, 1978

Functional Behavior in Data Spaces.

Acta Inf., 1978

Orthogonality of Information Structures.

Acta Inf., 1978

Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract).

Proceedings of the Automata, 1978

1977

On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space.

Theor. Comput. Sci., 1977

1976

The Semantical Definition of Programming Languages in Terms of Their Data Spaces.

Proceedings of the Programmiersprachen, 1976

On the Relationship between a Procedure and its Data.

Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1974

Context-Limited Grammars.

J. ACM, 1974

1967

A Generalization of Context-Free Determinism

Information and Control, 1967

1966

The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages.

J. ACM, 1966

1964

Solvability of Machine Mappings of Regular Sets to Regular Sets.

J. ACM, 1964

1963

A Simple Sorting Algorithm.

J. ACM, 1963

An empirical study of minimal storage sorting.

Commun. ACM, 1963

1962

Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting.

J. ACM, 1962

1961

Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines.

J. ACM, 1961

Theory of programmed processes.

Commun. ACM, 1961