The SCEAS System
Navigation Menu

Journals in DBLP

Int. J. Found. Comput. Sci.
1993, volume: 4, number: 3

  1. Stephan Olariu, Iain A. Stewart
    A New Characterization of Unbreakable Graphs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:193-196 [Journal]
  2. Fairouz Kamareddine, Rob Nederpelt
    On Stepwise Explicit Substitution. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:197-240 [Journal]
  3. Alexei Lisitsa
    Complexity of Universal Circumscription. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:241-244 [Journal]
  4. Lane A. Hemaspaandra, Sanjay Jain, Nikolai K. Vereshchagin
    Banishing Robust Turing Completeness. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:245-265 [Journal]
  5. B. F. Melnikov
    The Equality Condition for Infinite Catenations of Two Sets of Finite Words. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 1993, v:4, n:3, pp:267-274 [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