Theoretical Computer Science, Volume 188

Volume 188, Numbers 1-2, 30 November 1997

• S. V. Nagaraj:
  Optimal Binary Search Trees. 1-44
  
• Olivier Heen:
  Linear Speed-Up for Cellular Automata Synchronizers and Applications. 45-57
  
• Sandeep Sen:
  Lower Bounds for Parallel Algebraic Decision Trees, Parallel Complexity of Convex Hulls and Related Problems. 59-78
  
• Kathleen Romanik:
  Approximate Testing and Its Relationship to Learning. 79-99
  
• Kenneth W. Regan, Heribert Vollmer:
  Gap-Languages and Log-Time Complexity Classes. 101-116
  
• Vince Grolmusz:
  On the Power of Circuits with Gates of Low L₁ Norms. 117-128
  
• Eric Goles Ch., Ivan Rapaport:
  Complexity of Tile Rotation Problems. 129-159
  
• Anton Cerný:
  On Sequences Resulting from Iteration of Modified Quadratic and Palindromic Mappings. 161-174
  
• Rusins Freivalds, Sanjay Jain:
  Kolmogorov Numberings and Minimal Identification. 175-194
  
• Jean-Paul Allouche, Fritz von Haeseler, Heinz-Otto Peitgen, A. Petersen, Guentcho Skordev:
  Automaticity of Double Sequences Generated by One-Dimensional Linear Cellular Automata. 195-209
  
• Viktor Gyuris:
  A Short Proof of Representability of Fork Algebras. 211-220
  
• Hong Shen:
  Optimal Algorithms for Generalized Searching in Sorted Matrices. 221-230
  
• Dongyang Long, Jian Ma, Duanning Zhou:
  Structure of 3-Infix-Outfix Maximal Codes. 231-240
  
• Renren Liu:
  An Improved Shellsort Algorithm. 241-247