Journals in DBLP

Theor. Comput. Sci.
1991, volume: 86, number: 2

1. Amir Averbuch, Zvi Galil, Shmuel Winograd
   Classification of All the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. Part II: The Algebra G[u]/<u^n>. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:143-203 [Journal]
   
2. Jean-Claude Spehner
   Merging in Maps and in Pavings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:205-232 [Journal]
   
3. Kosaburo Hashiguchi
   Recognizable Closures and Submonoids of Free Partially Commutative Monoids. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:233-241 [Journal]
   
4. Marek Chrobak, David Eppstein
   Planar Orientations with Low Out-degree and Compaction of Adjacency Matrices. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:243-266 [Journal]
   
5. Matthias Krause, Christoph Meinel, Stephan Waack
   Separating the Eraser Turing Machine Classes L_e, NL_e, co-NL_e and P_e. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:267-275 [Journal]
   
6. Alberto Bertoni, Massimiliano Goldwurm, Nicoletta Sabadini
   The Complexity of Computing the Number of Strings of Given Length in Context-Free Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:325-342 [Journal]
   
7. Carl-Johan H. Seger
   On the Existence of Speed-Independent Circuits. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:343-364 [Journal]
   
8. Renato M. Capocelli, Luisa Gargano, Ugo Vaccaro
   Decoders with Initial State Invariance for Multivalued Encodings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:365-375 [Journal]
   
9. Gyora M. Benedek, Alon Itai
   Learnability with Respect to Fixed Distributions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:86, n:2, pp:377-390 [Journal]