Journals in DBLP

Theor. Comput. Sci.
1997, volume: 172, number: 1-2

1. Jeff Edmonds
   Removing Ramsey Theory: Lower Bounds With Smaller Domain Size. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:1-41 [Journal]
   
2. Paul Fischer, Klaus-Uwe Höffgen, Hanno Lefmann
   PAC-Learning from General Examples. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:43-65 [Journal]
   
3. Isabelle Fagnot
   Sur les facteurs des mots automatiques. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:67-89 [Journal]
   
4. Bruno Apolloni, S. Chiaravalli
   PAC Learning of Concept Classes Through the Boundaries of Their Items. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:91-120 [Journal]
   
5. Eric Goles Ch., Maurice Margenstern
   Universality of the Chip-Firing Game. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:121-134 [Journal]
   
6. W. G. Handley
   Deterministic summation modulo B_n, the Semigroup of Binary Relations on {0, 1, ..., n-1}. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:135-174 [Journal]
   
7. Goos Kant, Xin He
   Regular Edge Labeling of 4-Connected Plane Graphs and Its Applications in Graph Drawing Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:175-193 [Journal]
   
8. Klaus Ambos-Spies, Sebastiaan Terwijn, Xizhong Zheng
   Resource Bounded Randomness and Weakly Complete Problems. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:195-207 [Journal]
   
9. Andreas Brandstädt, Feodor F. Dragan, Falk Nicolai
   Homogeneously Orderable Graphs. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 1997, v:172, n:1-2, pp:209-232 [Journal]
   
10. Nick D. Dendris, Lefteris M. Kirousis, Dimitrios M. Thilikos
    Fugitive-Search Games on Graphs and Related Parameters. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:233-254 [Journal]
    
11. Jean-Christophe Hohl
    Massively Parallel Factorizations of Polynomials With Many Non-Commuting Variables. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:255-263 [Journal]
    
12. Shinichi Shimozono
    Finding Optimal Subgraphs by Local Search. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:265-271 [Journal]
    
13. Igor Rystsov
    Reset Words for Commutative and Solvable Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:273-279 [Journal]
    
14. Costas S. Iliopoulos, Dennis Moore, William F. Smyth
    A Characterization of the Squares in a Fibonacci String. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:281-291 [Journal]
    
15. Petr Savický, Stanislav Zák
    A Lower Bound on Branching Programs Reading Some Bits Twice. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:293-301 [Journal]
    
16. Günter Rote
    Finding a Shortest Vector in a Two-Dimensional Lattice Modulo m. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:303-308 [Journal]
    
17. Hendrik Jan Hoogeboom, Anca Muscholl
    The Code Problem for Traces - Improving the Boundaries. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:172, n:1-2, pp:309-321 [Journal]