Journals in DBLP

Theor. Comput. Sci.
1995, volume: 143, number: 2

1. Rémy Malgouyres
   Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle - Parametrization of Discretized Curves. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:189-249 [Journal]
   
2. Martín Matamala
   Recursive Construction of Periodic Steady State for Neural Networks. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:251-267 [Journal]
   
3. John Harrison
   Dynamical Properties of PWD0L Systems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:269-284 [Journal]
   
4. Giora Slutzki, Sándor Vágvölgyi
   Deterministic Top-Down Tree Transducers with Iterated Lookahead. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:285-308 [Journal]
   
5. Zhi-Zhong Chen
   The Maximal f-Dependent Set Problem for Planar Graphs is in NC. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:309-318 [Journal]
   
6. Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi
   Modular Nim. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:319-333 [Journal]
   
7. Xaver Gubás, Juraj Hromkovic, Juraj Waczulík
   A Nonlinear Lower Bound on the Practical Combinational Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:335-342 [Journal]
   
8. Wojciech Rytter
   Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:343-352 [Journal]
   
9. Louxin Zhang
   On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1995, v:143, n:2, pp:353-362 [Journal]