Journals in DBLP

Theor. Comput. Sci.
1981, volume: 15, number:

1. Gunther Schmidt
   Programs as Partial Graphs I: Flow Equivalence and Correctness. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:1-25 [Journal]
   
2. Ronald V. Book
   Bounded Query Machines: On NP and PSPACE. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:27-39 [Journal]
   
3. Ronald V. Book, Celia Wrathall
   Bounded Query Machines: On NP( ) and NPQERY( ). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:41-50 [Journal]
   
4. Toshiro Araki, Toyohiko Kagimasa, Nobuki Tokura
   Relations of Flow Languages to Petri Net Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:51-75 [Journal]
   
5. Daniel Lazard
   Resolution des Systemes d'Equations Algebriques. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:77-110 [Journal]
   
6. Charles E. Hughes, Stanley M. Selkow
   The Finite Power Property for Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:111-114 [Journal]
   
7. Stephan Heilbrunner
   A Parsing Automata Approach to LR Theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:117-157 [Journal]
   
8. Gunther Schmidt
   Programs as Partial Graphs II: Recursion. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:159-179 [Journal]
   
9. Lawrence H. Landweber, Richard J. Lipton, Edward L. Robertson
   On the Structure of Sets in NP and Other Complexity Classes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:15, n:, pp:181-200 [Journal]
   
10. A. Alder, Volker Strassen
    On the Algorithmic Complexity of Associative Algebras. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:201-211 [Journal]
    
11. Giorgio Germano, Andrea Maggiolo-Schettini
    Sequence Recursiveness Without Cylindrification and Limited Register Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:213-221 [Journal]
    
12. James W. Thatcher, Eric G. Wagner, Jesse B. Wright
    More on Advice on Structuring Compilers and Proving them Correct. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:223-249 [Journal]
    
13. Azaria Paz, Shlomo Moran
    Non Deterministic Polynomial Optimization Problems and their Approximations. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:251-277 [Journal]
    
14. E. W. Leggett Jr., Daniel J. Moore
    Optimization Problems and the Polynomial Hierarchy. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:279-289 [Journal]
    
15. Howard P. Katseff, Michael Sipser
    Several Results in Program Size Complexity. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:291-309 [Journal]
    
16. Michael C. Loui
    A Space Bound for One-Tape Multidimensional Turing Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:311-320 [Journal]
    
17. Richard Statman
    On the Existence of Closed Terms in the Typed lambda Calculus II: Transformations of Unification Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:15, n:, pp:329-338 [Journal]