Journals in DBLP

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

1. A. S. Troelstra
   On the Syntax of Martin-Löf's Type Theories. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:1-26 [Journal]
   
2. Philippe le Chenadec
   Analysis of Dehn's Algorithm by Critical Pairs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:27-52 [Journal]
   
3. Klaus W. Wagner
   More Complicated Questions About Maxima and Minima, and Some Closures of NP. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:53-80 [Journal]
   
4. Annegret Habel, Hans-Jörg Kreowski
   Characteristics of Graph Languages Generated by Edge Replacement. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:81-115 [Journal]
   
5. Joffroy Beauquier, Françoise Gire
   Une Note sur le Théorème de Caractérisation des Générateurs Algébriques. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:117-127 [Journal]
   
6. Jos C. M. Baeten, Jan A. Bergstra, Jan Willem Klop
   On the Consistency of Koomen's Fair Abstraction Rule. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:129-176 [Journal]
   
7. Klaus Ambos-Spies, Hans Fleischhack, Hagen Huwig
   Diagonalizations over Polynomial Time Computable Sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:177-204 [Journal]
   
8. Fernando Orejas
   A Characterization of Passing Compatibility for Parameterized Specifications. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:205-214 [Journal]
   
9. Arturo Capri
   On Unambiguous Reductions of Monoids of Unambiguous Relations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1987, v:51, n:, pp:215-220 [Journal]
   
10. Jozef Vyskoc
    An O(n^lg k . 2^n/2) Time and O(k . 2^n/k) Space Algorithm for Certain NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:221-227 [Journal]
    
11. Edward G. Belaga
    Constructive Universal Algebra: An Introduction. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:229-238 [Journal]
    
12. Ian Parberry
    On the Time Required to Sum n Semigroup Elements on a Parallel Machine with Simultaneous Writes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:239-247 [Journal]
    
13. Tom Head, Barbara Lando
    Bounded D0L Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:255-264 [Journal]
    
14. Steven Homer, Timothy J. Long
    Honest Polynomial Degrees and P=?NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:265-280 [Journal]
    
15. Béatrice Bérard
    Literal Shuffle. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:281-299 [Journal]
    
16. Takashi Yokomori
    On Purely Morphic Characterizations of Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:301-308 [Journal]
    
17. Susumu Yamasaki, Mikio Yoshida, Shuji Doshita
    A Fixpoint Semantics of Horn Sentences Based on Substitution Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:309-324 [Journal]
    
18. Juraj Hromkovic
    Reversal-Bounded Nondeterministic Multicounter Machines and Complementation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:325-330 [Journal]
    
19. Thomas Beth
    On the Computational Complexity of the General Discrete Fourier Transform. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:331-339 [Journal]
    
20. Zvi Galil, Raffaele Giancarlo
    Parallel String Matching with k Mismatches. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:51, n:, pp:341-348 [Journal]