The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1989, volume: 67, number: 2&3

  1. Klaus Madlener, Friedrich Otto
    About the Descriptive Power of Certain Classes of Finite String-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:143-172 [Journal]
  2. Leo Bachmair, Nachum Dershowitz
    Completion for Rewriting Modulo a Congruence. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:173-201 [Journal]
  3. Jean H. Gallier, Wayne Snyder
    Complete Sets of Transformations for General E-Unification. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:203-260 [Journal]
  4. Christine Choppy, Stéphane Kaplan, Michèle Soria
    Complexity Analysis of Term-Rewriting Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:261-282 [Journal]
  5. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop, W. P. Weijland
    Term-Rewriting Systems with Rule Priorities. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:283-301 [Journal]
  6. Hélène Kirchner
    Schematization of Infinite Sets of Rewrite Rules Generated by Divergent Completion Processes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:67, n:2&3, pp:303-332 [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