Journals in DBLP

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

1. Jeffrey M. Jaffe
   Efficient Scheduling of Tasks without Full Use of Processor Resources. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:1-17 [Journal]
   
2. N. Saheb-Djahromi
   CPO'S of Measures for Nondeterminism. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:19-37 [Journal]
   
3. Józef Winkowski
   Behaviours of Concurrent Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:39-60 [Journal]
   
4. David Harel
   Proving the Correctness of Regular Deterministic Programs: A Unifying Survey Using Dynamic Logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:61-81 [Journal]
   
5. Giorgio Ausiello, Alberto Marchetti-Spaccamela, Marco Protasi
   Toward a Unified Approach for the Classification of NP-Complete Optimization Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:83-96 [Journal]
   
6. Louis Monier
   Evaluation and Comparison of Two Efficient Probabilistic Primality Testing Algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:97-108 [Journal]
   
7. Maurice Mignotte
   Tests de Primalite. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:109-117 [Journal]
   
8. Philip W. Grant
   Some More Independence Results in Complexity Theory. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:119-126 [Journal]
   
9. Andrzej Ehrenfeucht, Grzegorz Rozenberg
   On Ambiguity in E0L Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1980, v:12, n:, pp:127-134 [Journal]
   
10. Hermann A. Maurer, Arto Salomaa, Derick Wood
    Synchronized E0L Forms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:135-159 [Journal]
    
11. Dana Angluin
    On Counting Problems and the Polynomial-Time Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:161-173 [Journal]
    
12. Guy Cousineau
    An Algebraic Definition for Control Structures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:175-192 [Journal]
    
13. John C. Beatty
    Two Iteration Theorems for the LL(k) Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:193-228 [Journal]
    
14. Jerzy Tiuryn
    Unique Fixed Points Vs. Least Fixed Points. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:229-254 [Journal]
    
15. David P. Dobkin, J. Ian Munro
    Determining the Mode. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:255-263 [Journal]
    
16. Aravind K. Joshi, Leon S. Levy, Kang Yueh
    Local Constraints in Programming Languages Part I: Syntax. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:265-290 [Journal]
    
17. Derek C. Oppen
    Complexity, Convexity and Combinations of Theories. [Citation Graph (2, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:291-302 [Journal]
    
18. Leslie G. Valiant
    Negation can be Exponentially Powerful. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:303-314 [Journal]
    
19. J. Ian Munro, Mike Paterson
    Selection and Sorting with Limited Storage. [Citation Graph (3, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:315-323 [Journal]
    
20. Jean-Marie Boë, Aldo de Luca, Antonio Restivo
    Minimal Complete Sets of Words. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:325-332 [Journal]
    
21. John Gill, James Hunt, Janos Simon
    Deterministic Simulation of Tape-Bounded Probabilistic Turing Machine Transducers. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:333-338 [Journal]
    
22. Andrzej Ehrenfeucht, Grzegorz Rozenberg
    On a Bound for the D0L Sequence Equivalence Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1980, v:12, n:, pp:339-342 [Journal]