The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1995, volume: 142, number: 2

  1. Claude Kirchner
    Editorial. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:139-140 [Journal]
  2. Christopher Lynch, Wayne Snyder
    Redundancy Criteria for Constrained Completion. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:141-177 [Journal]
  3. Nachum Dershowitz, Charles Hoot
    Natural Termination. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:179-207 [Journal]
  4. Albert Rubio, Robert Nieuwenhuis
    A Total AC-Compatible Ordering Based on RPO. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:209-227 [Journal]
  5. Franz Baader, Klaus U. Schulz
    Combination Techniques and Decision Problems for Disunification. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:229-255 [Journal]
  6. Géraud Sénizergues
    Some Undecidable Termination Problems for Semi-Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:257-276 [Journal]
  7. Andrea Asperti, Cosimo Laneve
    Paths, Computations and Labels in the lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:277-297 [Journal]
  8. Jean H. Gallier
    Proving Properties of Typed lambda-Terms Using Realizability, Covers, and Sheaves. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:142, n:2, pp:299-368 [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