Journals in DBLP

Theor. Comput. Sci.
1989, volume: 68, number: 2

1. Vikraman Arvind, Somenath Biswas
   On Some Bandwidth Restricted Versions of the Satisfiability Problem of Propositional CNF Formulas. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:68, n:2, pp:123-134 [Journal]
   
2. Howard A. Blair, V. S. Subrahmanian
   Paraconsistent Logic Programming. [Citation Graph (4, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:68, n:2, pp:135-154 [Journal]
   
3. Andrzej Lingas, Andrzej Proskurowski
   On Parallel Complexity of the Subgraph Homeomorphism and the Subgraph Isomorphism Problem for Classes of Planar Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:68, n:2, pp:155-173 [Journal]
   
4. Joachim Parrow
   Submodule Construction as Equation Solving in CCS. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:68, n:2, pp:175-202 [Journal]
   
5. Ramaswamy Ramanujam
   Semantics of Distributed Definite Clause Programs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:68, n:2, pp:203-220 [Journal]