Journals in DBLP

Theor. Comput. Sci.
1992, volume: 97, number: 2

1. Mark W. Krentel
   Generalizations of Opt P to the Polynomial Hierarchy. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:183-198 [Journal]
   
2. Osamu Watanabe, Shouwen Tang
   On Polynomial-Time Turing and Many-One Completeness in PSPACE. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:199-215 [Journal]
   
3. Heekeun Yoo, Kosaburo Hashiguchi
   Extended Regular Expressions of Arbitrary Star Degrees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:217-231 [Journal]
   
4. David E. Muller, Ahmed Saoudi, Paul E. Schupp
   Alternating Automata, the Weak Monadic Theory of Trees and its Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:233-244 [Journal]
   
5. Georg Karner
   Nivat's Theorem for Pushdown Transducers. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:245-262 [Journal]
   
6. Richard A. Shore, Theodore A. Slaman
   The p-T Degrees of the Recursive Sets: Lattice Embeddings, Extensions of Embeddings and the Two-Quantifier Theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:263-284 [Journal]
   
7. Juraj Hromkovic, Sergej A. Lozkin, Andrej I. Rybko, Alexander A. Sapozhenko, Nadezda A. Skalikova
   Lower Bounds on the Area Complexity of Boolean Circuits. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:285-300 [Journal]
   
8. Giovanna Guaiana, Antonio Restivo, Sergio Salemi
   Star-Free Trace Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1992, v:97, n:2, pp:301-311 [Journal]