The SCEAS System
Navigation Menu

Journals in DBLP

J. Comput. Syst. Sci.
1999, volume: 58, number: 3

  1. Christos H. Papadimitriou, Mihalis Yannakakis
    On the Complexity of Database Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:407-427 [Journal]
  2. Serge Abiteboul, Victor Vianu
    Regular Path Queries with Constraints. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:428-452 [Journal]
  3. Giansalvatore Mecca, Paolo Atzeni
    Cut and Paste. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:453-482 [Journal]
  4. Marc Gyssens, Jan Van den Bussche, Dirk Van Gucht
    Complete Geometric Query Languages. [Citation Graph (2, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:483-511 [Journal]
  5. Joseph Albert, Yannis E. Ioannidis, Raghu Ramakrishnan
    Equivalence of Keyed Relational Schemas by Conjunctive Queries. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:512-534 [Journal]
  6. Freddy Dumortier, Marc Gyssens, Luc Vandeurzen, Dirk Van Gucht
    On the Decidability of Semilinearity for Semialgebraic Sets and Its Implications for Spatial Databases. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:535-571 [Journal]
  7. Jonathan F. Buss, Gudmund Skovbjerg Frandsen, Jeffrey Shallit
    The Computational Complexity of Some Problems of Linear Algebra. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:572-596 [Journal]
  8. Giovanni Manzini, Luciano Margara
    Attractors of Linear Cellular Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:597-610 [Journal]
  9. Jürgen Dassow, Victor Mitrana
    Stack Cooperation in Multistack Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:611-621 [Journal]
  10. Jianer Chen, Donald K. Friesen, Hao Zheng
    Tight Bound on Johnson's Algorithm for Maximum Satisfiability. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:622-640 [Journal]
  11. Adam Krawczyk
    The Complexity of Finding a Second Hmiltonian Cycle in Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:641-647 [Journal]
  12. Lane A. Hemaspaandra, Jörg Rothe
    Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:648-659 [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