Theoretical Computer Science, Volume 276

Volume 276, Number 1-2, April 2002

• Robert Cori, Dominique Rossin, Bruno Salvy:
  Polynomial ideals for sandpiles and their Gröbner bases. 1-15
  
• Vincent Bouchitté, Ioan Todinca:
  Listing all potential maximal cliques of a graph. 17-32
  
• Gruia Calinescu, Peng-Jun Wan:
  Splittable traffic partition in WDM/SONET rings to minimize SONET ADMs. 33-50
  
• Stefan Droste, Thomas Jansen, Ingo Wegener:
  On the analysis of the (1+1) evolutionary algorithm. 51-81
  
• Amber Settle, Janos Simon:
  Smaller solutions for the firing squad. 83-109
  
• Bin Ma, Lusheng Wang, Kaizhong Zhang:
  Computing similarity between RNA structures. 111-132
  
• Subhamoy Maitra, Palash Sarkar:
  Cryptographically significant Boolean functions with five valued Walsh spectra. 133-146
  
• Harumichi Nishimura, Masanao Ozawa:
  Computational complexity of uniform quantum circuit families and quantum Turing machines. 147-181
  
• Vesa Halava, Tero Harju, Mika Hirvensalo:
  Binary (generalized) Post Correspondence Problem. 183-204
  
• Erzsébet Csuhaj-Varjú, György Vaszil:
  Parallel communicating grammar systems with bounded resources. 205-219
  
• Zoltán Fülöp, Alain Terlutte:
  Iterated relabeling tree transducers. 221-244
  
• Kai Salomaa, Sheng Yu:
  Decidability of EDT0L structural equivalence. 245-259
  
• David Manlove, Robert W. Irving, Kazuo Iwama, Shuichi Miyazaki, Yasufumi Morita:
  Hard variants of stable marriage. 261-279
  
• Jacques Justin, Giuseppe Pirillo:
  Episturmian words and episturmian morphisms. 281-313
  
• Serafino Cicerone, Gabriele Di Stefano, Michele Flammini:
  Static and dynamic low-congested interval routing schemes. 315-354
  
• Stavros Konstantinidis, Amber O'Hearn:
  Error-detecting properties of languages. 355-375
  
• Henning Fernau, Ralf Stiebe:
  Sequential grammars and automata with valences. 377-405
  
• Vladimir V. V'yugin:
  Does snooping help? 407-415
  
• Chiuyuan Chen:
  A necessary condition for a graph to be the visibility graph of a simple polygon. 417-424
  
• Gregorio Malajovich:
  Lower bounds for some decision problems over C. 425-434
  
• J. M. Robson:
  Constant bounds on the moments of the height of binary search trees. 435-444
  
• Christophe Prieur:
  How to decide continuity of rational functions on infinite words. 445-447
  
• Yongge Wang:
  A comparison of two approaches to pseudorandomness. 449-459