Thomas N. Hibbard

Available identifiers

zbMath Open hibbard.thomas-nDBLP98/2269WikidataQ19958083 ScholiaQ19958083MaRDI QIDQ1141476

List of research outcomes

Publication	Date of Publication	Type
An algorithm for testing permutativeness of cellular automata	2009-10-09	Paper
Local area networks as supercomputers	1998-08-02	Paper
https://portal.mardi4nfdi.de/entity/Q3771593	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5184375	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3674060	1983-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4190136	1979-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4160417	1978-01-01	Paper
Orthogonality of information structures	1978-01-01	Paper
On the formal definition of dependencies between the control and information structure of a data space	1978-01-01	Paper
Functional behavior in data spaces	1978-01-01	Paper
Formal Modeling of Virtual Machines	1978-01-01	Paper
Data spaces with indirect addressing	1978-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4195924	1977-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4101414	1976-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q4121392	1976-01-01	Paper
Context-Limited Grammars	1974-01-01	Paper
A generalization of context-free determinism	1967-01-01	Paper
The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages	1966-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q5586368	1966-01-01	Paper
Sequences in context free languages	1965-01-01	Paper
A Simple Sorting Algorithm	1963-01-01	Paper
An empirical study of minimal storage sorting	1963-01-01	Paper
Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting	1962-01-01	Paper
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines	1961-01-01	Paper
Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines	1961-01-01	Paper

Research outcomes over time

This page was built for person: Thomas N. Hibbard