Journals in DBLP

Theor. Comput. Sci.
1982, volume: 19, number:

1. Yehoshua Perl, Shmuel Zaks
   On the Complexity of Edge Labelings for Trees. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:1-16 [Journal]
   
2. Oscar H. Ibarra, Brian S. Leininger, Shlomo Moran
   On the Complexity of Simple Arithmetic Expressions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:17-28 [Journal]
   
3. Karel Culik II, Arto Salomaa
   On Infinite Words Obtained by Iterating Morphisms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:29-38 [Journal]
   
4. Dima Grigoriev
   Additive Complexity in Directed Computations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:39-67 [Journal]
   
5. Ravi Sethi
   Pebble Games for Studying Storage Sharing. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:69-84 [Journal]
   
6. A. Cardon, Maxime Crochemore
   Partitioning a Graph in O(|A| log2 |V|). [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:85-98 [Journal]
   
7. Mike Holcombe
   On the Holonomy Decomposition of Transformation Semigroups. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:99-104 [Journal]
   
8. T. Ito, Yasuaki Nishitani
   On Universality of Concurrent Expressions with Synchronization Primitives. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:105-115 [Journal]
   
9. Peter Padawitz
   Graph Grammars and Operational Semantics. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1982, v:19, n:, pp:117-141 [Journal]
   
10. Jan Paredaens
    A Universal Formalism to Express Decompositions, Functional Dependencies and Other Constraints in a Relational Database. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:143-160 [Journal]
    
11. Harry R. Lewis, Christos H. Papadimitriou
    Symmetric Space-Bounded Computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:161-187 [Journal]
    
12. Greg N. Frederickson, Joseph JáJá
    On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:189-201 [Journal]
    
13. Andrew Chi-Chih Yao
    On the Time-Space Tradeoff for Sorting with Linear Queries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:203-218 [Journal]
    
14. Oscar H. Ibarra
    2DST Mapppings on Languages and Related Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:219-227 [Journal]
    
15. Jean H. Gallier
    Corrigendum: DPDA's in "Atomic Normal Form" and Applications to Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:229- [Journal]
    
16. Ronald V. Book, Matthias Jantzen, Celia Wrathall
    Monadic Thue Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:231-251 [Journal]
    
17. Rüdiger Reischuk
    A Fast Implementation of a Multidimensional Storage Into a Tree Storage. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:253-266 [Journal]
    
18. Paolo Atzeni, Giorgio Ausiello, Carlo Batini, Marina Moscarini
    Inclusion and Equivalence between Relational Database Schemata. [Citation Graph (15, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:267-285 [Journal]
    
19. Alan L. Selman
    Reductions on NP and P-Selective Sets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:287-304 [Journal]
    
20. Helge Szwerinski
    Time-Optimal Solution of the Firing-Squad-Synchronization-Problem for n-Dimensional Rectangles with the General at an Arbitrary Position. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:305-320 [Journal]
    
21. Marc Snir
    Comparisons between Linear Functions can Help. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:321-330 [Journal]
    
22. Bernard R. Hodgson
    On Direct Products of Automaton Decidable Theories. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:331-335 [Journal]
    
23. Nimrod Megiddo
    Is Binary Encoding Appropriate for the Problem-Language Relationship? [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:337-341 [Journal]