The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Thomas N. Hibbard: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

Search in 0.002secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002