The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1997, volume: 54, number: 3

  1. Manindra Agrawal
    DSPACE(n) = NSPACE(n): A Degree Theoretic Characterization. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:383-392 [Journal]
  2. Harry Buhrman, Elvira Mayordomo
    An Excursion to the Kolmogorov Random Strings. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:393-399 [Journal]
  3. Kousha Etessami
    Counting Quantifiers, Successor Relations, and Logarithmic Space. [Citation Graph (4, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:400-411 [Journal]
  4. John D. Rogers
    The Isomorphism Conjecture Holds and One-Way Functions Exists Relative to an Oracle. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:412-423 [Journal]
  5. James S. Royer
    Semantics vs Syntax vs Computations: Machine Models for Type-2 Polynomial-Time Bounded Functionals. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:424-436 [Journal]
  6. Nicholas Q. Trân
    On P-Immunity of Exponential Time Complete Sets. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:437-440 [Journal]
  7. Domenico Saccà
    The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries. [Citation Graph (3, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:441-464 [Journal]
  8. Liming Cai, Jianer Chen
    On Fixed-Parameter Tractability and Approximability of NP Optimization Problems. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:465-474 [Journal]
  9. Yosi Ben-Asher, Ilan Newman
    Geometric Approach for Optimal Routing on a Mesh with Buses. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:475-486 [Journal]
  10. H. David Mathias
    A Model of Interactive Teaching. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:487-501 [Journal]
  11. Karl Meinke
    A Completeness Theorem for the Expressive Power of Higher-Order Algebraic Specifications. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1997, v:54, n:3, pp:502-519 [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