Journals in DBLP

Theor. Comput. Sci.
1989, volume: 66, number: 1

1. Thomas Lehmkuhl, Thomas Lickteig
   On the Order of Approximation in Approximative Triadic Decompositions of Tensors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:1-14 [Journal]
   
2. Paul E. S. Dunne
   On Monotone Simulations of Nonmonotone Networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:15-25 [Journal]
   
3. Adolfo Piperno
   Abstraction Problems in Combinatory Logic a Compositive Approach. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:27-43 [Journal]
   
4. Jarkko Kari
   Observations Concerning a Public-Key Cryptosystem Based on Iterated Morphisms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:45-53 [Journal]
   
5. Zhang Luo Xin
   A Efficient Algorithm to Decide Whether a Monoid Presented by a Regular Church-Rosser Thue System is a Group. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:55-63 [Journal]
   
6. Rieks op den Akker
   On LC(0) Grammars and Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:65-85 [Journal]
   
7. Alasdair Urquhart
   The Complexity of Gentzen Systems for Propositional Logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:87-97 [Journal]
   
8. Richard Statman
   On Sets of Solutions to Combinator Equations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:99-104 [Journal]
   
9. Andrzej Pelc
   Weakly Adaptive Comparison Searching. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1989, v:66, n:1, pp:105-111 [Journal]
   
10. Daniele Mundici
    Functions Computed by Monotone Boolean Formulas with no Repeated Variables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:1, pp:113-114 [Journal]