Journals in DBLP

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

1. John C. Shepherdson
   In Memoriam Calvin C. Elgot. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:1-4 [Journal]
   
2. Klaus Weihrauch, Ulrich Schreiber
   Embedding Metric Spaces Into CPO's. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:5-24 [Journal]
   
3. Andrzej Ehrenfeucht, Grzegorz Rozenberg
   On the Subword Complexity of Square-Free D0L Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:25-32 [Journal]
   
4. Ju. M. Vazenin
   Sur la Liaison Entre Problemes Combinatoires et Algorithmiques. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:33-41 [Journal]
   
5. Satoru Takasu, Sukemitsu Kawabata
   A Logical Basis for Programming Methodology. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:43-60 [Journal]
   
6. Matthias Jantzen
   On a Special Monoid with a Single Defining Relation. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:61-73 [Journal]
   
7. Janos Simon
   On Tape-Bounded Probabilistic Turing Machine Acceptors. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:75-91 [Journal]
   
8. Michael G. Main, David B. Benson
   Free Upper Regular Bands. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:93-98 [Journal]
   
9. Karl J. Lieberherr
   Uniform Complexity and Digital Signatures. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1981, v:16, n:, pp:99-110 [Journal]
   
10. Ren-ji Tao
    On the Computational Power of Automata with Time or Space Bounded by Ackermann's or Superexponential Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:115-148 [Journal]
    
11. Jan Pittl
    On LLP(k) Grammars and Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:149-175 [Journal]
    
12. Giulia Galbiati
    M. J. Fischer: On the Complexity of 2-Output Boolean Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:177-185 [Journal]
    
13. Kari-Jouko Räihä, Esko Ukkonen
    The Shortest Common Supersequence Problem over Binary Alphabet is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:187-198 [Journal]
    
14. L. Csirmaz
    Programs and Program Verifications in a General Setting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:199-210 [Journal]
    
15. V. L. Nguyen, Jean-Louis Lassez
    A Dual Problem to Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:211-221 [Journal]
    
16. Ronald V. Book, Colm Ó'Dúnlaing
    Testing for the Church-Rosser Property. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:223-229 [Journal]
    
17. J. Lawrence Carter, Ronald Fagin
    A Note on the Existence of Continuous Functionals. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:231-235 [Journal]
    
18. H. C. M. Kleijn, Grzegorz Rozenberg
    Context-Free Like Restrictions on Selective Rewriting. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:237-269 [Journal]
    
19. K. Lam, M. K. Siu, Clement T. Yu
    A Generalized Counter Scheme. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:271-278 [Journal]
    
20. Walter A. Burkhard, Michael L. Fredman, Daniel J. Kleitman
    Inherent Complexity Trade-Offs for Range Query Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:279-290 [Journal]
    
21. J. Albert, Lutz Michael Wegner
    Languages with Homomorphic Replacements. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:291-305 [Journal]
    
22. U. I. Gupta, D. T. Lee, Joseph Y.-T. Leung, J. W. Pruitt, C. K. Wong
    Record Allocation for Minimizing Seek Delay. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:307-319 [Journal]
    
23. Francine Berman, Mike Paterson
    Propositional Dynamic Logic is Weaker without Tests. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:321-328 [Journal]
    
24. Herbert Edelsbrunner, Hermann A. Maurer
    A Space-Optimal Solution of General Region Location. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:329-336 [Journal]
    
25. Jean-Pierre Pécuchet
    Sur la Determination du Rang d'une Equation dans le Monoide Libre. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1981, v:16, n:, pp:337-340 [Journal]