Journals in DBLP

Theor. Comput. Sci.
1991, volume: 82, number: 1

1. Klaus Weihrauch, Christoph Kreitz
   Type 2 Computational Complexity of Functions on Cantor's Space. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:1-18 [Journal]
   
2. Barbara Lando
   Periodicity and Ultimate Periodicity of D0L Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:19-33 [Journal]
   
3. Jean-Jacques Hébrard
   An Algorithm for Distinguishing Efficiently Bit-Strings by their Subsequences. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:35-49 [Journal]
   
4. Ker-I Ko
   On Adaptive Versus Nonadaptive Bounded Query Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:51-69 [Journal]
   
5. Filippo Mignosi
   On the Number of Factors of Sturmian Words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:71-84 [Journal]
   
6. Marc Snir
   Size-depth Trade-Offs for Monotone Arithmetic Circuits. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:85-93 [Journal]
   
7. Joost Engelfriet, George Leih, Grzegorz Rozenberg
   Nonterminal Separation in Graph Grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:95-111 [Journal]
   
8. Martin Dietzfelbinger, Wolfgang Maass, Georg Schnitger
   The Complexity of Matrix Transposition on One-Tape Off-Line Turing Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:113-129 [Journal]
   
9. Kai Salomaa, Sheng Yu
   Decidability of Structural Equivalence of E0L Grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:82, n:1, pp:131-139 [Journal]
   
10. J. M. Robson
    An O (T log T) Reduction from RAM Computations to Satisfiability. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:141-149 [Journal]
    
11. Cristian Calude, Gabriel Istrate
    Determining and Stationary Sets for Some Classes of Partial Recursive Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:151-155 [Journal]
    
12. Vladimir Palko, Ondrej Sýkora, Imrich Vrto
    Area Complexity of Merging. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:157-163 [Journal]
    
13. Joop M. I. M. Leo
    A General Context-Free Parsing Algorithm Running in Linear Time on Every LR (k) Grammar Without Using Lookahead. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:82, n:1, pp:165-176 [Journal]