Theoretical Computer Science, Volume 339

Volume 339, Number 1, June 2005

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

Volume 339, Number 2-3, June 2005

• Yijia Chen, Jörg Flum, Martin Grohe:
  Machine-based methods in parameterized complexity theory. 167-199
  Electronic Edition (link) BibTeX
• Andreas Maletti:
  HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. 200-240
  Electronic Edition (link) BibTeX
• Shengyu Zhang:
  On the power of Ambainis lower bounds. 241-256
  Electronic Edition (link) BibTeX
• Cheng-Kuan Lin, Hua-Min Huang, Lih-Hsing Hsu:
  The super connectivity of the pancake graphs and the super laceability of the star graphs. 257-271
  Electronic Edition (link) BibTeX
• Cristina Bazgan, Bruno Escoffier, Vangelis Th. Paschos:
  Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness. 272-292
  Electronic Edition (link) BibTeX
• Yong He, Yiwei Jiang:
  Optimal semi-online preemptive algorithms for machine covering on two uniform machines. 293-314
  Electronic Edition (link) BibTeX
• Amitabha Bagchi, Amitabh Chaudhary, Petr Kolman:
  Short length Menger's theorem and reliable optical routing. 315-332
  Electronic Edition (link) BibTeX
• Peter Damaschke, Zhen Zhou:
  On queuing lengths in on-line switching. 333-343
  Electronic Edition (link) BibTeX
• Murray J. Elder:
  A context-free and a 1-counter geodesic language for a Baumslag-Solitar group. 344-371
  Electronic Edition (link) BibTeX