Journals in DBLP

Theor. Comput. Sci.
1980, volume: 11, number:

1. David P. Dobkin, Steven P. Reiss
   The Complexity of Linear Programming. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:1-18 [Journal]
   
2. Jan A. Bergstra, Jan Willem Klop
   Invertible Terms in the Lambda Calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:19-37 [Journal]
   
3. John Staples
   Speeding up Subtree Replacement Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:39-47 [Journal]
   
4. Nicholas Pippenger
   On Another Boolean Matrix. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:49-56 [Journal]
   
5. Anna R. Bruss, Albert R. Meyer
   On Time-Space Classes and their Relation to the Theory of Real Addition. [Citation Graph (1, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:59-69 [Journal]
   
6. Leonard Berman
   The Complexitiy of Logical Theories. [Citation Graph (2, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:71-77 [Journal]
   
7. Masato Morisaki, Kô Sakai
   A Complete Axiom System for Rational Sets with Multiplicity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:79-92 [Journal]
   
8. Ludek Kucera, Jaroslav Nesetril, Ales Pultr
   Complexity of Dimension Three and Some Related Edge-Covering Characteristics of Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:93-106 [Journal]
   
9. Günter Hotz
   Eine neue Invariante für Kontextfreie Sprachen. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:11, n:, pp:107-116 [Journal]
   
10. Frank Harary
    Graph Theoretic Models. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:117-121 [Journal]
    
11. Egon Börger, Hans Kleine Büning
    The Reachability Problem for Petri Nets and Decision Problems for Skolem Arithmetic. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:123-143 [Journal]
    
12. Arnold L. Rosenberg, Larry J. Stockmeyer, Lawrence Snyder
    Uniform Data Encodings. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:145-165 [Journal]
    
13. W. M. Beynon
    On the Structure of Free Finite State Machines. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:167-180 [Journal]
    
14. André Arnold, Maurice Nivat
    Metric Interpretations of Infinite Trees and Semantics of non Deterministic Recursive Programs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:181-205 [Journal]
    
15. B. Bougaut
    Algorithme Explicite pour la Recherche du P.G.C.D. dans certains Anneaux Principaux d'Entiers de Corps de Nombres. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:207-220 [Journal]
    
16. Bernard Vauquelin, Paul Franchi-Zannettacci
    Automates a File. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:221-225 [Journal]
    
17. Matthew Hennessy, Edward A. Ashcroft
    A Mathematical Semantics for a Nondeterministic Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:227-245 [Journal]
    
18. Hartmut Ehrig, Barry K. Rosen
    Parallelism and Concurrency of Graph Manipulations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:247-275 [Journal]
    
19. Dexter Kozen
    Indexings of Subrecursive Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:277-301 [Journal]
    
20. Norbert Blum, Kurt Mehlhorn
    On the Average Number of Rebalancing Operations in Weight-Balanced Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:303-320 [Journal]
    
21. Joos Heintz, Malte Sieveking
    Lower Bounds for Polynomials with Algebraic Coefficients. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:321-330 [Journal]
    
22. Joachim von zur Gathen, Volker Strassen
    Some Polynomials that are Hard to Compute. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:331-335 [Journal]
    
23. Angelo Barone Netto
    There are Infinitely Many Complete Prefix Codes of Constant Length l (l greater than 3). [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:337-339 [Journal]
    
24. Mordechai Ben-Ari
    Comments on "Tautology Testing with a Generalized Matrix Reduction Method". [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:11, n:, pp:341- [Journal]