Journals in DBLP

Theor. Comput. Sci.
2005, volume: 339, number: 1

1. Tero Harju, Juhani Karhumäki, Antonio Restivo
   Preface. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:1-2 [Journal]
   
2. Sergei I. Adian
   Divisibility problem for one relator monoids. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:3-6 [Journal]
   
3. James D. Currie
   Pattern avoidance: themes and variations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:7-18 [Journal]
   
4. Narad Rampersad, Jeffrey Shallit, Ming-wei Wang
   Avoiding large squares in infinite binary words. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:19-34 [Journal]
   
5. Leszek Gasieniec, Roman M. Kolpakov, Igor Potapov
   Space efficient search for maximal repetitions. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:35-48 [Journal]
   
6. Sorin Constantinescu, Lucian Ilie
   Generalised fine and Wilf's theorem for arbitrary number of periods. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:49-60 [Journal]
   
7. S. Stepán Holub
   A proof of the extended Duval's conjecture. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:61-67 [Journal]
   
8. Anna E. Frid
   Sequences of linear arithmetical complexity. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:68-87 [Journal]
   
9. Isabel M. Araújo, Véronique Bruyère
   Sturmian words and a criterium by Michaux-Villemaire. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:1, pp:88-102 [Journal]
   
10. Florence Levé, Gwénaël Richomme
    On a conjecture about finite fixed points of morphisms. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:103-128 [Journal]
    
11. Florent Hivert, Jean-Christophe Novelli, Jean-Yves Thibon
    The algebra of binary search trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:339, n:1, pp:129-165 [Journal]