Journals in DBLP

Theor. Comput. Sci.
1987, volume: 52, number:

1. Marek Zaionc
   Word Operation Definable in the Typed lambda-Calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:1-14 [Journal]
   
2. Ker-I Ko
   On Helping by Robust Oracle Machines. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:15-36 [Journal]
   
3. Richard Kennaway
   On ``On Graph Rewritings''. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:37-58 [Journal]
   
4. Jacques Sakarovitch
   On Regular Trace Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:59-75 [Journal]
   
5. Joachim von zur Gathen
   Factoring Polynomials and Primitive Elements for Special Primes. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:77-89 [Journal]
   
6. B. Seite
   A Yacc Extension for LRR Grammar Parsing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:91-143 [Journal]
   
7. Daniele Mundici
   Satisfiability in Many-Valued Sentential Logic is NP-Complete. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:145-153 [Journal]
   
8. Paul G. Spirakis
   The Parallel Complexity of Deadlock Detection. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:155-163 [Journal]
   
9. Tetsuo Moriya
   Topological Characterizations of Infinite Tree Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:52, n:, pp:165-171 [Journal]
   
10. Changwook Kim, Ivan Hal Sudborough
    The Membership and Equivalence Problems for Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:177-191 [Journal]
    
11. John M. Marberg, Eli Gafni
    Distributed Sorting Algorithms for Multi-Channel Broadcast Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:193-203 [Journal]
    
12. Matthias Felleisen, Daniel P. Friedman, Eugene E. Kohlbecker, Bruce F. Duba
    A Syntactic Theory of Sequential Control. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:205-237 [Journal]
    
13. R. G. Nigmatullin
    Models of Lower-Bounds Proofs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:239-249 [Journal]
    
14. José L. Balcázar, Josep Díaz, Joaquim Gabarró
    On Characterizations of the Class PSPACE/POLY. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:251-267 [Journal]
    
15. Erol Gelenbe, David Finkel
    Stationary Deterministic Flows: II. The Single-Server Queue. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:269-280 [Journal]
    
16. Rodney W. Topor
    Domain-Independent Formulas and Databases. [Citation Graph (8, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:281-306 [Journal]
    
17. Gheorghe Stefanescu
    On Flowchart Theories: Part II. The Nondeterministic Case. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:307-340 [Journal]
    
18. Franz-Josef Brandenburg
    A Note on: `Deque Automata and a Subfamily of Context-Sensitive Languages which Contains All Semilinear Bounded Languages'. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:341-342 [Journal]