Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[2]
Hilfe
Suche: Author="Hibbard, Thomas N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Data spaces with indirect addressing
Armin B. Cremers
,
Thomas N. Hibbard
Math. Systems Theory
12
, 1978/79, pp. 151-173
On the relationship between a procedure and its data
Armin Cremers
,
Thomas N. Hibbard
Lecture Notes in Computer Science
45
, 1976, pp. 250-254
A generalization of context-free determinism
Thomas N. Hibbard
Information and Control
11
, 1967, pp. 196-238
The interdependence of inherent ambiguity from completeness among context-free languages
Thomas N. Hibbard
Journal of the ACM
13
, 1966, pp. 588-593
Solvability of machine mappings of regular sets to regular sets
Seymour Ginsburg
,
Thomas N. Hibbard
Journal of the ACM
11
, 1964, pp. 302-312
A simple sorting algorithm
Thomas N. Hibbard
Journal of the ACM
10
, 1963, pp. 142-150
Some combinatorial properties of certain trees with applications to searching and sorting
Thomas N. Hibbard
Journal of the ACM
9
, 1962, pp. 13-28
Least upper bounds on minimal terminal state experiments for two classes of sequential machines
Thomas N. Hibbard
Journal of the ACM
8
, 1961, pp. 601-612