Thomas N. Hibbard - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 21 from 21

2009

An algorithm for testing permutativeness of cellular automataThomas N. Hibbard, Camilo Jadur, Jorge Yazlle. aam, 43(4):323-330, 2009. [doi]

1991

Axioms for Concurrent ProcessesArmin B. Cremers, Thomas N. Hibbard. BIRTHDAY 1991: 54-68

1983

Applicative State Transition Systems in LISP-Like NotationArmin B. Cremers, Thomas N. Hibbard. gi 1983: 51-66

1979

Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report)Armin B. Cremers, Thomas N. Hibbard. icalp 1979: 147-160

1978

Orthogonality of Information StructuresArmin B. Cremers, Thomas N. Hibbard. ACTA, 9:243-261, 1978.

Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract)Armin B. Cremers, Thomas N. Hibbard. icalp 1978: 165-176

Functional Behavior in Data SpacesArmin B. Cremers, Thomas N. Hibbard. ACTA, 9:293-307, 1978.

Formal Modeling of Virtual MachinesArmin B. Cremers, Thomas N. Hibbard. TSE, 4(5):426-436, 1978.

Data Spaces with Indirect AddressingArmin B. Cremers, Thomas N. Hibbard. mst, 12:151-173, 1978.

1977

On the Formal Definiton of Dependencies between the Control and Information Structure of a Data SpaceArmin B. Cremers, Thomas N. Hibbard. TCS, 5(2):113-128, 1977.

1976

On the Relationship between a Procedure and its DataArmin B. Cremers, Thomas N. Hibbard. mfcs 1976: 250-254

The Semantical Definition of Programming Languages in Terms of Their Data SpacesArmin B. Cremers, Thomas N. Hibbard. programmier 1976: 1-11

1974

Context-Limited GrammarsThomas N. Hibbard. JACM, 21(3):446-453, 1974. [doi]

1967

A Generalization of Context-Free DeterminismThomas N. Hibbard. iandc, 11(1/2):196-238, July-August 1967.

1966

The Independence of Inherent Ambiguity From Complementedness Among Context-Free LanguagesThomas N. Hibbard, Joseph S. Ullian. JACM, 13(4):588-593, 1966. [doi]

1964

Solvability of Machine Mappings of Regular Sets to Regular SetsSeymour Ginsburg, Thomas N. Hibbard. JACM, 11(3):302-312, 1964. [doi]

1963

An empirical study of minimal storage sortingThomas N. Hibbard. CACM, 6(5):206-213, 1963. [doi]

A Simple Sorting AlgorithmThomas N. Hibbard. JACM, 10(2):142-150, 1963. [doi]

1962

Some Combinatorial Properties of Certain Trees With Applications to Searching and SortingThomas N. Hibbard. JACM, 9(1):13-28, 1962. [doi]

1961

Theory of programmed processesThomas N. Hibbard. CACM, 4(4):195, 1961. [doi]

Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential MachinesThomas N. Hibbard. JACM, 8(4):601-612, 1961. [doi]

Sign in or sign up to see more results.

runs on WebDSL