We stand with Ukraine  

Thomas N. Hibbard

Affiliations:
  • National University of Salta, Argentina
  • California Institute of Technology, Jet Propulsion Laboratory, Pasadena, CA, USA (former)
  • University of California, Los Angeles, CA, USA (PhD 1966)


According to our database1, Thomas N. Hibbard authored at least 21 papers between 1961 and 2009.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2009
An algorithm for testing permutativeness of cellular automata.
[BibTeX]
[DOI]
Thomas N. Hibbard
,
Camilo Jadur
,
Jorge Yazlle
Adv. Appl. Math., 2009

1991
Axioms for Concurrent Processes.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the New Results and New Trends in Computer Science, 1991

1983
Applicative State Transition Systems in LISP-Like Notation.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the GI - 13. Jahrestagung, Hamburg, 3.-7. Oktober 1983, Proceedings, 1983

1979
Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report).
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the Automata, 1979

1978
Formal Modeling of Virtual Machines.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
IEEE Trans. Software Eng., 1978

Data Spaces with Indirect Addressing.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Math. Syst. Theory, 1978

Functional Behavior in Data Spaces.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Acta Informatica, 1978

Orthogonality of Information Structures.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Acta Informatica, 1978

Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract).
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the Automata, 1978

1977
On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Theor. Comput. Sci., 1977

1976
The Semantical Definition of Programming Languages in Terms of Their Data Spaces.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the Programmiersprachen, 1976

On the Relationship between a Procedure and its Data.
[BibTeX]
[DOI]
Armin B. Cremers
,
Thomas N. Hibbard
Proceedings of the Mathematical Foundations of Computer Science 1976, 1976

1974
Context-Limited Grammars.
[BibTeX]
[DOI]
Thomas N. Hibbard
J. ACM, 1974

1967
A Generalization of Context-Free Determinism
[BibTeX]
[DOI]
Thomas N. Hibbard
Inf. Control., 1967

1966
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages.
[BibTeX]
[DOI]
Thomas N. Hibbard
,
Joseph S. Ullian
J. ACM, 1966

1964
Solvability of Machine Mappings of Regular Sets to Regular Sets.
[BibTeX]
[DOI]
Seymour Ginsburg
,
Thomas N. Hibbard
J. ACM, 1964

1963
A Simple Sorting Algorithm.
[BibTeX]
[DOI]
Thomas N. Hibbard
J. ACM, 1963

An empirical study of minimal storage sorting.
[BibTeX]
[DOI]
Thomas N. Hibbard
Commun. ACM, 1963

1962
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting.
[BibTeX]
[DOI]
Thomas N. Hibbard
J. ACM, 1962

1961
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines.
[BibTeX]
[DOI]
Thomas N. Hibbard
J. ACM, 1961

Theory of programmed processes.
[BibTeX]
[DOI]
Thomas N. Hibbard
Commun. ACM, 1961


  Loading...