Journals in DBLP

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

1. Bruno Courcelle
   Basic Notions of Universal Algebra for Language Theory and Graph Grammars. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:1-54 [Journal]
   
2. Stephen L. Bloom, Zoltán Ésik
   Free Shuffle Algebras in Language Varieties. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:55-98 [Journal]
   
3. Damian Niwinski, Igor Walukiewicz
   Games for the mu-Calculus. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:99-116 [Journal]
   
4. Livio Colussi, Laura Toniolo
   How the Character Comparison Order Shapes the Shift Function of On-Line Pattern Matching Algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:117-144 [Journal]
   
5. Denis Derencourt
   A Three-Word Code Which is Not Prefix-Suffix Composed. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:145-160 [Journal]
   
6. E. Hausen-Tropper
   A Framework for a Theory of Automated Learning. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:161-176 [Journal]
   
7. Richard Beigel, William I. Gasarch, Efim B. Kinber
   Frequency Computation and Bounded Queries. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:177-192 [Journal]
   
8. Siegfried Lehr, Jeffrey Shallit, John Tromp
   On the Vector Space of the Automatic Reals. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:193-210 [Journal]
   
9. Christos Levcopoulos, Ola Petersson
   Exploiting Few Inversions When Sorting: Sequential and Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1996, v:163, n:1&2, pp:211-238 [Journal]
   
10. Gu Xunrang, Zhu Yuzhang
    Optimal Heapsort Algorithm. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:239-243 [Journal]
    
11. Heribert Vollmer, Klaus W. Wagner
    Recursion Theoretic Characterizations of Complexity Classes of Counting Functions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:245-258 [Journal]
    
12. Dongyang Long
    On Group Codes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:259-267 [Journal]
    
13. Daniel Fredholm
    Computing Minimum with Primitive Recursion over Lists. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:269-276 [Journal]
    
14. Robert H. Gilman
    A Shrinking Lemma for Indexed Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:277-281 [Journal]
    
15. Tatsuie Tsukiji
    On a Small Class of Boolean Sums. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:283-289 [Journal]
    
16. François Blanchard, Alejandro Maass
    Dynamical Behaviour of Coven's Aperiodic Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:291-302 [Journal]
    
17. Rémy Malgouyres
    There is no Local Characterization of Separating and Thin Objects in Z³. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:303-308 [Journal]
    
18. Djelloul Ziadi
    Regular Expression for a Language without Empty Word. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:163, n:1&2, pp:309-315 [Journal]