Journals in DBLP

Theor. Comput. Sci.
1991, volume: 88, number: 1

1. Ricard Gavaldà, José L. Balcázar
   Strong and Robustly Strong Polynomial-Time Reducibilities to Sparse Sets. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:1-14 [Journal]
   
2. Kim Guldstrand Larsen, Bent Thomsen
   Partial Specifications and Compositional Verification. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:15-32 [Journal]
   
3. Satoru Miyano
   Delta_2^P-Complete Lexicographically First Maximal Subgraph Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:33-57 [Journal]
   
4. Maxime Crochemore, Wojciech Rytter
   Usefulness of the Karp-Miller-Rosenberg Algorithm in Parallel Computations on Strings and Arrays. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:59-82 [Journal]
   
5. Max H. Garzon, Yechezkel Zalcstein
   The Complexity of Grigorchuk Groups with Application to Cryptography. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:83-98 [Journal]
   
6. Sang Cho, Dung T. Huynh
   Finite-Automaton Aperiodicity is PSPACE-Complete. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:99-116 [Journal]
   
7. Priti Shankar, B. S. Adiga
   A Graph-Based Regularity Test for Deterministic Context-free Languages. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:117-125 [Journal]
   
8. Arto Salomaa
   A Deterministic Algorithm for Modular Knapsack Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:127-138 [Journal]
   
9. Joost Engelfriet
   A Regular Characterization of Graph Languages Definable in Monadic Second-Order Logic. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1991, v:88, n:1, pp:139-150 [Journal]
   
10. Kunio Aizawa, Akira Nakamura
    Graph Grammars with Path-Controlled Embedding. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:151-170 [Journal]
    
11. Salah Labhalla, Henri Lombardi
    Représentations des nombres réels par développements en base entière et complexité. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:171-182 [Journal]
    
12. Samir Khuller, Vijay V. Vazirani
    Planar Graph Coloring is not Self-Reducible, Assuming P != NP. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1991, v:88, n:1, pp:183-189 [Journal]