The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

David B. Benson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carl H. Hauser, David B. Benson
    On the Practicality and Desirability of Highly-concurrent, Mostly-functional Programming. [Citation Graph (0, 0)][DBLP]
    ACSD, 2004, pp:115-124 [Conf]
  2. David B. Benson
    An abstract machine theory for formal language parsers. [Citation Graph (0, 0)][DBLP]
    Category Theory Applied to Computation and Control, 1974, pp:106-111 [Conf]
  3. David B. Benson
    The Category of Milner Processes is Exact. [Citation Graph (0, 0)][DBLP]
    Category Theory and Computer Science, 1987, pp:71-97 [Conf]
  4. Michael G. Main, David B. Benson
    Functional Behaviour of Nondeterministic Programs. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:290-301 [Conf]
  5. David B. Benson
    Syntactic Clues [Citation Graph (0, 0)][DBLP]
    FOCS, 1970, pp:133-138 [Conf]
  6. David B. Benson, Ralph D. Jeffords
    Parallel Decomposition of LR(k) Parsers (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:76-86 [Conf]
  7. David B. Benson, Ofer Ben-Shachar
    Strong Bisimulation of State Automata [Citation Graph (0, 0)][DBLP]
    LICS, 1986, pp:77-81 [Conf]
  8. David B. Benson
    The Shuffle Bialgebra. [Citation Graph (0, 0)][DBLP]
    MFPS, 1987, pp:616-637 [Conf]
  9. David B. Benson, Jerzy Tiuryn
    Fixed Ponts in Process Algebras with Internal Actions ( a preliminary note). [Citation Graph (0, 0)][DBLP]
    Mathematical Foundations of Programming Semantics, 1985, pp:53-58 [Conf]
  10. David B. Benson
    A machine level semantics for nondeterministic, parallel programs. [Citation Graph (0, 0)][DBLP]
    Symposium on Programming, 1982, pp:15-25 [Conf]
  11. David B. Benson
    An Abstract Machine Theory for Formal Language Parsers [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1974, v:3, n:, pp:187-202 [Journal]
  12. Michael G. Main, David B. Benson
    Denotational Semantics for ``Natural'' Language Question-Answering Programs. [Citation Graph (0, 0)][DBLP]
    American Journal of Computational Linguistics, 1983, v:9, n:1, pp:11-21 [Journal]
  13. David B. Benson
    Separating the complexity classes NL and NP [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  14. David B. Benson
    Concurrency and interleaving are equally fundamental. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1987, v:33, n:, pp:54- [Journal]
  15. David B. Benson
    Syntax and Semantics: A Categorical View [Citation Graph (0, 0)][DBLP]
    Information and Control, 1970, v:17, n:2, pp:145-160 [Journal]
  16. David B. Benson
    The Basic Algebraic Structures in Categories of Derivations [Citation Graph (0, 0)][DBLP]
    Information and Control, 1975, v:28, n:1, pp:1-29 [Journal]
  17. David B. Benson, Ofer Ben-Shachar
    Bisimulation of Automata [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1988, v:79, n:1, pp:60-83 [Journal]
  18. Michael G. Main, David B. Benson
    Functional Behvior of Nondeterministic and Concurrent Programs [Citation Graph (0, 0)][DBLP]
    Information and Control, 1984, v:62, n:2/3, pp:144-189 [Journal]
  19. David B. Benson
    Life in the game of Go. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1976, v:10, n:1, pp:17-29 [Journal]
  20. David B. Benson
    Parameter Passing in Nondeterministic Recursive Programs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:1, pp:50-62 [Journal]
  21. David B. Benson, Irène Guessarian
    Algebraic Solutions to Recursion Schemes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1987, v:35, n:3, pp:365-400 [Journal]
  22. Richard J. Lorentz, David B. Benson
    Deterministic and Nondeterministic Flowchart Interpretations. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1983, v:27, n:3, pp:400-433 [Journal]
  23. Michael G. Main, David B. Benson
    Free Semiring-Representations and Nondeterminism. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1985, v:30, n:3, pp:318-328 [Journal]
  24. David B. Benson
    Semantic Preserving Translations. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1975, v:8, n:2, pp:105-126 [Journal]
  25. David B. Benson
    In Scott-Strachey Style Denotational Semantics, Parallelism Implies Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1982, v:15, n:3, pp:267-275 [Journal]
  26. David B. Benson
    Some Preservation Properties of Normal Form Grammars. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:381-402 [Journal]
  27. David B. Benson, Michael G. Main
    Workshop Report: Third Workshop on the Mathematical Foundations of Programming Language Semantics, 1987, New Orleans. [Citation Graph (0, 0)][DBLP]
    SIGPLAN Notices, 1987, v:22, n:9, pp:38-43 [Journal]
  28. David B. Benson, Jerzy Tiuryn
    Fixed Points in Free Process Algebras, Part I. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:63, n:3, pp:275-294 [Journal]
  29. Michael G. Main, David B. Benson
    Free Upper Regular Bands. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:93-98 [Journal]
  30. Jerzy Tiuryn, David B. Benson
    Fixed Points in Free Process Algebras, Part II. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:70, n:2, pp:179-192 [Journal]
  31. David B. Benson
    Counting Paths: Nondeterminism as Linear Algebra. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Software Eng., 1984, v:10, n:6, pp:785-794 [Journal]

Search in 0.160secs, Finished in 0.162secs
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