Journals in DBLP

Theor. Comput. Sci.
1993, volume: 119, number: 2

1. Miroslaw Kutylowski
   Stack versus Sensitivity for One-Way Automata. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:233-245 [Journal]
   
2. Alberto Apostolico, Andrzej Ehrenfeucht
   Efficient Detection of Quasiperiodicities in Strings. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:247-265 [Journal]
   
3. Jean-Camille Birget
   Partial Orders on Words, Minimal Elements of Regular Languages and State Complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:267-291 [Journal]
   
4. Marius Zimand
   If not Empty, NP - P is Topologically Large. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:293-310 [Journal]
   
5. Walter Stromquist, Daniel Ullman
   Sequential Compounds of Combinatorial Games. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:311-321 [Journal]
   
6. David Wolfe
   Snakes in Domineering Games. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:323-329 [Journal]
   
7. Roberto Tamassia, Ioannis G. Tollis
   Dynamic Reachability in Planar Digraphs with One Source and One Sink. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:331-343 [Journal]
   
8. Bruce E. Litow, Philippe Dumas
   Additive Cellular Automata and Algebraic Series. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:345-354 [Journal]
   
9. B. John Oommen, David T. H. Ng
   An Optimal Absorbing List Organization Strategy with Constant Memory Requirements. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1993, v:119, n:2, pp:355-361 [Journal]
   
10. Tao Jiang, Ming Li
    On the Complexity of Learning Strings and Sequences. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:119, n:2, pp:363-371 [Journal]