The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1991, volume: 90, number: 2

  1. Teodor Rus
    Algebraic Construction of Compliers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:271-308 [Journal]
  2. Makoto Tatsuta
    Program Synthesis Using Realizability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:309-353 [Journal]
  3. Takashi Saito
    Dynamics of Equivalence Relations in Automata Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:355-367 [Journal]
  4. Yoshihito Toyama
    How to Prove Equivalence of Term Rewriting Systems Without Induction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:369-390 [Journal]
  5. Guozhu Dong, Seymour Ginsburg
    Localizable Constraints for Object Histories. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:391-432 [Journal]
  6. Dimiter Vakarelov
    Modal Logics for Knowledge Representation Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:90, n:2, pp:433-456 [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