Theoretical Computer Science, Volume 244

Volume 244, Numbers 1-2, 6 August 2000

• Joachim Apel:
  Computational ideal theory in finitely generated extension rings. 1-33
  
• Jung-Heum Park, Kyung-Yong Chwa:
  Recursive circulants and their embeddings among hypercubes. 35-62
  
• Bruno Courcelle:
  The monadic second-order logic of graphs XIII: Graph drawings with edge crossings. 63-94
  
• Oya Ekin, Peter L. Hammer, Alexander Kogan:
  Convexity and logical analysis of data. 95-116
  
• Juha Honkala:
  On D0L power series. 117-134
  
• Matthias Ott, Frank Stephan:
  Structural measures for games and process control in the branch learning model. 135-165
  
• Hans L. Bodlaender, Michael R. Fellows, Michael T. Hallett, Todd Wareham, Tandy Warnow:
  The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs. 167-188
  
• Peter Jonsson:
  Boolean constraint satisfaction: complexity results for optimization problems with arbitrary weights. 189-203
  
• Lane A. Hemaspaandra, Jörg Rothe:
  A second step towards complexity-theoretic analogs of Rice's Theorem. 205-217
  
• Gianpiero Cattaneo, Michele Finelli, Luciano Margara:
  Investigating topological chaos by elementary cellular automata dynamics. 219-241
  
• Zsuzsanna Róka:
  The firing squad synchronization problem on Cayley graphs. 243-256
  
• Lane A. Hemaspaandra, Jörg Rothe:
  Characterizing the existence of one-way permutations. 257-261
  
• Eric Kern, Maurice Mignotte:
  Applications of the representation of finite fields by matrices. 263-265
  
• Juha Honkala:
  A short solution for the HDT0L sequence equivalence problem. 267-270
  
• Michel Rigo:
  Generalization of automatic sequences for numeration systems on a regular language. 271-281
  
• Dieter van Melkebeek:
  The zero-one law holds for BPP. 283-288
  
• Jozef Kelemen, Alica Kelemenová, Carlos Martín-Vide, Victor Mitrana:
  Colonies with limited activation of components. 289-298