The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
1991, volume: 2, number: 2

  1. Vikraman Arvind, Somenath Biswas
    Edge-Deletion Graph Problems with First-Order Expressible Subgraph Properties. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:83-99 [Journal]
  2. Thanh Tung Nguyen
    A Relational Model of Demonic Nondeterministic Programs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:101-131 [Journal]
  3. Hans L. Bodlaender
    On the Complexity of Some Coloring Games. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:133-147 [Journal]
  4. Sachio Hirokawa
    Prinipal Type Assignment to Lambda Terms. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:149-162 [Journal]
  5. Tao Jiang, Edward McDowell, Bala Ravikumar
    The Structure and Complexity of Minimal NFA's over a Unary Alphabet. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1991, v:2, n:2, pp:163-182 [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