Thomas N. Hibbard

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

- CSB - MetaPress - Google - Bing - Yahoo

	1991
c6		Armin B. Cremers, Thomas N. Hibbard: Axioms for Concurrent Processes. New Results and New Trends in Computer Science 1991: 54-68
	1983
c5		Armin B. Cremers, Thomas N. Hibbard: Applicative State Transition Systems in LISP-Like Notation. GI Jahrestagung 1983: 51-66
	1979
c4		Armin B. Cremers, Thomas N. Hibbard: Arbitration and Queuing Under Limited Shared Storage Requirements (Preliminary Report). ICALP 1979: 147-160
	1978
j14		Armin B. Cremers, Thomas N. Hibbard: Orthogonality of Information Structures. Acta Inf. 9: 243-261 (1978)
j13		Armin B. Cremers, Thomas N. Hibbard: Functional Behavior in Data Spaces. Acta Inf. 9: 293-307 (1978)
j12		Armin B. Cremers, Thomas N. Hibbard: Data Spaces with Indirect Addressing. Mathematical Systems Theory 12: 151-173 (1978)
j11		Armin B. Cremers, Thomas N. Hibbard: Formal Modeling of Virtual Machines. IEEE Trans. Software Eng. 4(5): 426-436 (1978)
c3		Armin B. Cremers, Thomas N. Hibbard: Mutual Exclusion of N Processors Using an O(N)-Valued Message Variable (Extended Abstract). ICALP 1978: 165-176
	1977
j10		Armin B. Cremers, Thomas N. Hibbard: On the Formal Definiton of Dependencies between the Control and Information Structure of a Data Space. Theor. Comput. Sci. 5(2): 113-128 (1977)
	1976
c2		Armin B. Cremers, Thomas N. Hibbard: On the Relationship between a Procedure and its Data. MFCS 1976: 250-254
c1		Armin B. Cremers, Thomas N. Hibbard: The Semantical Definition of Programming Languages in Terms of Their Data Spaces. Fachtagung über Programmiersprachen 1976: 1-11
	1974
j9		Thomas N. Hibbard: Context-Limited Grammars. J. ACM 21(3): 446-453 (1974)
	1967
j8		Thomas N. Hibbard: A Generalization of Context-Free Determinism. Information and Control 11(1/2): 196-238 (1967)
	1966
j7		Thomas N. Hibbard, Joseph S. Ullian: The Independence of Inherent Ambiguity From Complementedness Among Context-Free Languages. J. ACM 13(4): 588-593 (1966)
	1964
j6		Seymour Ginsburg, Thomas N. Hibbard: Solvability of Machine Mappings of Regular Sets to Regular Sets. J. ACM 11(3): 302-312 (1964)
	1963
j5		Thomas N. Hibbard: An empirical study of minimal storage sorting. Commun. ACM 6(5): 206-213 (1963)
j4		Thomas N. Hibbard: A Simple Sorting Algorithm. J. ACM 10(2): 142-150 (1963)
	1962
j3		Thomas N. Hibbard: Some Combinatorial Properties of Certain Trees With Applications to Searching and Sorting. J. ACM 9(1): 13-28 (1962)
	1961
j2		Thomas N. Hibbard: Theory of programmed processes. Commun. ACM 4(4): 195 (1961)
j1		Thomas N. Hibbard: Least Upper Bounds on Minimal Terminal State Experiments for Two Classes of Sequential Machines. J. ACM 8(4): 601-612 (1961)

Coauthor Index

1	Armin B. Cremers	[c6] [c5] [c4] [j14] [j13] [j12] [j11] [c3] [j10] [c2] [c1]
2	Seymour Ginsburg	[j6]
3	Joseph S. Ullian	[j7]

Last update Sat May 25 14:12:54 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page