Journals in DBLP

Theory Comput. Syst.
2003, volume: 36, number: 1

1. Patrizio Cintioli, Riccardo Silvestri
   Polynomial Time Introreducibility. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:1, pp:1-15 [Journal]
   
2. Debashis Bera, Madhumangal Pal, Tapan Kumar Pal
   An Efficient Algorithm for Finding All Hinge Vertices on Trapezoid Graphs. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:1, pp:17-27 [Journal]
   
3. Howard Straubing, Denis Thérien
   Regular Languages Defined by Generalized First-Order Formulas with a Bounded Number of Bound Variables. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:1, pp:29-69 [Journal]
   
4. Satyanarayana V. Lokam
   Graph Complexity and Slice Functions. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:1, pp:71-88 [Journal]
   
5. Juha Honkala
   The Equivalence Problem of Polynomially Bounded D0L Systems - a Bound Depending Only on the Size of the Alphabet. [Citation Graph (0, 0)][DBLP]
   Theory Comput. Syst., 2003, v:36, n:1, pp:89-103 [Journal]