Journals in DBLP

Theor. Comput. Sci.
1996, volume: 161, number: 1&2

1. Zhi-Zhong Chen
   Parallel Constructions of Maximal Path Sets and Applications to Short Superstrings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:1-21 [Journal]
   
2. F. Carrere
   On the Kleijn-Rozenberg k-Adjacent Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:23-68 [Journal]
   
3. Salah Labhalla, Henri Lombardi, Roger Marlin
   Algorithmes de calcul de la réduction de Hermite d'une matrice à coefficients polynomiaux. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:69-92 [Journal]
   
4. Tero Harju, Marjo Lipponen, Alexandru Mateescu
   Flatwords and Post Correspondence Problem. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:93-108 [Journal]
   
5. Alain J. Mayer, Larry J. Stockmeyer
   The Complexity of PDL with Interleaving. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:109-122 [Journal]
   
6. Lance Fortnow, Martin Kummer
   On Resource-Bounded Instance Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:123-140 [Journal]
   
7. H. Petersen
   On the Language of Primitive Words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:141-156 [Journal]
   
8. Carla Selmi
   Over Testable Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:157-190 [Journal]
   
9. Olivier Carton
   Chain Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:161, n:1&2, pp:191-203 [Journal]
   
10. Günter Hotz, Gisela Pitsch
    On Parsing Coupled-Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:205-233 [Journal]
    
11. Mark A. Fulk, Sanjay Jain
    Learning in the Presence of Inaccurate Information. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:235-261 [Journal]
    
12. Kenneth W. Regan
    Index Sets and Presentations of Complexity Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:263-287 [Journal]
    
13. Osamu Maruyama, Satoru Miyano
    Inferring a Tree from Walks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:289-300 [Journal]
    
14. Felipe Cucker, Mike Shub
    Generalized Knapsack Problems and Fixed Degree Separations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:301-306 [Journal]
    
15. Alexander E. Andreev, Andrea E. F. Clementi, José D. P. Rolim
    Constructing the Highest Degree Subgraph for Dense Graphs is in NCAS. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:161, n:1&2, pp:307-314 [Journal]