Theoretical Computer Science, Volume 246

Volume 246, Numbers 1-2, 6 September 2000

• Frank Drewes:
  Tree-based picture generation. 1-51
  
• Frank Nielsen:
  Fast stabbing of boxes in high dimensions. 53-72
  
• Reneta P. Barneva, Valentin E. Brimkov, Philippe Nehlig:
  Thin discrete triangular meshes. 73-105
  
• Toshihiro Fujito:
  Approximating minimum feedback vertex sets in hypergraphs. 107-116
  
• Jérôme Olivier Durand-Lose:
  Reversible space-time simulation of cellular automata. 117-129
  
• Taishin Y. Nishida, Shigeko Seki:
  Grouped partial ET0L systems and parallel multiple context-free grammars. 131-150
  
• Didier Arquès, Jean François Béraud:
  Le Schéma de carte et ses applications. 151-194
  
• J. W. Sander, Robert Tijdeman:
  The complexity of functions on lattices. 195-225
  
• Yih-Kai Lin, Kuo-Liang Chung:
  A space-efficient Huffman decoding algorithm and its parallelism. 227-238
  
• Zhen Liu:
  Dynamic scheduling of parallel computations. 239-252
  
• Pedro García, José Ruiz:
  Right and left locally testable languages. 253-264
  
• Martin E. Dyer, Catherine S. Greenhill:
  Polynomial-time counting and sampling of two-rowed contingency tables. 265-278
  
• Alexander Meduna:
  Generative power of three-nonterminal scattered context grammars. 279-284
  
• Cunsheng Ding, David R. Kohel, San Ling:
  Secret-sharing with a class of ternary codes. 285-298