Journals in DBLP

Theor. Comput. Sci.
1983, volume: 22, number:

1. J. Roger Hindley
   The Completeness Theorem for Typing lambda-Terms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:1-17 [Journal]
   
2. Masahiko Sato
   Theory of Symbolic Expressions, I. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:19-55 [Journal]
   
3. Jan Pittl, Amiram Yehudai
   Constructing a Realtime Deterministic Pushdown Automaton from a Grammar. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:57-69 [Journal]
   
4. Péter Gács
   On the Relation between Descriptional Complexity and Algorithmic Probability. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:71-93 [Journal]
   
5. Werner Kuich, Friedrich J. Urbanek
   Infinite Linear Systems and one Counter Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:95-126 [Journal]
   
6. J. Roger Hindley
   Curry's Type-Rules are Complete with Respect to the F-Semantics too. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:127-133 [Journal]
   
7. Gérard Boudol, Laurent Kott
   Recursion Induction Principle Revisited. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:135-173 [Journal]
   
8. Minoru Ito, Kenichi Taniguchi, Tadao Kasami
   Membership Problem for Embedded Multivalued Dependencies under some Restricted Conditions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:175-194 [Journal]
   
9. Grzegorz W. Wasilkowski
   Any Iteration for Polynomial Equations Using Linear Information has Infinite Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1983, v:22, n:, pp:195-208 [Journal]
   
10. D. T. Lee, C. L. Liu, C. K. Wong
    (g 0, g 1, ... g k)-Trees and Unary OL Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:209-217 [Journal]
    
11. Magnus Steinby
    Systolic Trees and Systolic Language Recognition by Tree Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:219-232 [Journal]
    
12. G. Lev, Leslie G. Valiant
    Size Bounds for Superconcentrators. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:233-251 [Journal]
    
13. Masako Takahashi
    Nest Sets and Relativized Closure Properties. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:253-264 [Journal]
    
14. Jan A. Bergstra, J. V. Tucker
    Hoare's Logic and Peano's Arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:265-284 [Journal]
    
15. Abraham Lempel, Gadiel Seroussi, Shmuel Winograd
    On the Complexity of Multiplication in Finite Fields. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:285-296 [Journal]
    
16. Alberto Apostolico, Franco P. Preparata
    Optimal Off-Line Detection of Repetitions in a String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:297-315 [Journal]
    
17. Walter Baur, Volker Strassen
    The Complexity of Partial Derivatives. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:317-330 [Journal]
    
18. Hermann A. Maurer, Arto Salomaa, Derick Wood
    L Codes and Number Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:22, n:, pp:331-346 [Journal]