The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1985, volume: 39, number:

  1. Christiane Frougny
    Context-Free Grammars with Cancellation Properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:3-13 [Journal]
  2. Jean-Louis Lassez, Michael J. Maher
    Optimal Fixedpoints of Logic Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:15-25 [Journal]
  3. Colin Stirling
    A Proof-Theoretic Characterization of Observational Equivalence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:27-45 [Journal]
  4. Ralph-Johan Back, Heikki Mannila
    On the Suitability of Trace Semantics for Modular Proofs of Communicating Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:47-68 [Journal]
  5. R. Kannan
    Solving Systems of Linear Equations over Polynomials. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:69-88 [Journal]
  6. Oscar H. Ibarra, Michael A. Palis, Jik H. Chang
    On Efficient Recognition of Transductions and Relations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:89-106 [Journal]
  7. Lutz Priese
    On a Fast Decomposition Method in Some Models of Concurrent Computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:107-121 [Journal]
  8. Deepak Kapur, Paliath Narendran, Mukkai S. Krishnamoorthy, Robert McNaughton
    The Church-Rosser Property and Special Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:123-133 [Journal]
  9. Corrado Böhm, Alessandro Berarducci
    Automatic Synthesis of Typed Lambda-Programs on Term Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:135-154 [Journal]
  10. Michel Parigot, Elisabeth Pelz
    A Logical Approach of Petri Net Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:155-169 [Journal]
  11. Jean-Claude Spehner
    Systèmes Entiers d'Équations sur un Alphabet Fini et Conjecture d'Ehrenfeucht. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:171-188 [Journal]
  12. Mario Rodríguez-Artalejo
    Some Questions about Expressiveness and Relative Completeness in Hoare's Logic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:189-206 [Journal]
  13. Stephen R. Mahaney, Paul Young
    Reductions Among Polynomial Isomorphism Types. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:207-224 [Journal]
  14. Deborah Joseph, Paul Young
    Some Remarks on Witness Functions for Nonpolynomial and Noncomplete Sets in NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:225-237 [Journal]
  15. Richard Hull
    Non-Finite Specifiability of Projections of Functional Dependency Families. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:239-265 [Journal]
  16. Jörg Vogel, Klaus Wagner
    Two-Way Automata with More than one Storage Medium. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:267-280 [Journal]
  17. Rani Siromoney, V. Rajkumar Dare
    On Infinite Words Obtained by Selective Substitution Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:281-295 [Journal]
  18. Armin Haken
    The Intractability of Resolution. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:297-308 [Journal]
  19. Seymour Ginsburg, Edwin H. Spanier
    On Completing Tables to Satisfy Functional Dependencies. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:309-317 [Journal]
  20. Ronald V. Book, Friedrich Otto
    On the Security of Name-Stamp Protocols. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:319-325 [Journal]
  21. Ernst L. Leiss
    On Solving Star Equations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:327-332 [Journal]
  22. André Arnold
    A Syntactic Congruence for Rational omega-Language. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:333-335 [Journal]
  23. Martin W. Bunder
    An Extension of Klop's Counterexample to the Church-Rosser Property to lambda-Calculus with other Ordered Pair Combinators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:337-342 [Journal]
  24. Joos Heintz
    Corrigendum: Definability and Fast Quantifier Elimination in Algebraically Closed Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:39, n:, pp:343- [Journal]
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