The SCEAS System
Navigation Menu

Journals in DBLP

Theor. Comput. Sci.
1977, volume: 4, number: 3

  1. Christos H. Papadimitriou
    The Euclidean Traveling Salesman Problem is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:237-244 [Journal]
  2. Matthew M. Geller, Michael A. Harrison
    On LR(k) Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:245-276 [Journal]
  3. Neil D. Jones, Lawrence H. Landweber, Y. Edmund Lien
    Complexity of Some Problems in Petri Nets. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:277-299 [Journal]
  4. Robert P. Daley
    On the Inference of Optimal Descriptions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:301-319 [Journal]
  5. Tmima Olshansky, Amir Pnueli
    A Direct Algorithm for Checking Equivalence of LL(k) Grammars. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1977, v:4, n:3, pp:321-349 [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