Theoretical Computer Science, Volume 143

Volume 143, Number 1, 29 May 1995

• Do Long Van, Bertrand Le Saëc, Igor Litovsky:
  Characterizations of Rational omega-Languages by Means of Right Congruences. 1-21
  
• Kamala Krithivasan, Meena Mahajan:
  Nondeterministic, Probabilistic and Alternating Computations on Cellular Array Models. 23-49
  
• Valentin M. Antimirov, Peter D. Mosses:
  Rewriting Extended Regular Expressions. 51-72
  
• Michael A. Bender, Michel Gastaldo, Michel Morvan:
  Parallel Interval Order Recognition and Construction of Interval Representations. 73-91
  
• Arthur S. Goldstein, Edward M. Reingold:
  The Complexity of Pursuit on a Graph. 93-112
  
• Tao Jiang, Vadim G. Timkovsky:
  Shortest Consistent Superstrings Computable in Polynomial Time. 113-122
  
• Akira Ito, Katsushi Inoue, Itsuo Takanami, Yue Wang:
  Optimal Simulation of Two-Dimensional Alternating Finite Automata by Three-Way Nondeterministic Turing Machines. 123-135
  
• Tao Jiang, Lusheng Wang, Kaizhong Zhang:
  Alignment of Trees - An Alternative to Tree Edit. 137-148
  
• David W. Juedes, Jack H. Lutz:
  Weak Completeness in E and E_2. 149-158
  
• Pierluigi Crescenzi, Christos H. Papadimitriou:
  Reversible Simulation of Space-Bounded Computations. 159-165
  
• Peter Bro Miltersen:
  On the Cell Probe Complexity of Polynomial Evaluation. 167-174
  
• Roberto De Prisco, Giuseppe Parlati, Giuseppe Persiano:
  Minimal Path Length of Trees with Known Fringe. 175-188
  

Volume 143, Number 2, 12 June 1995

• Rémy Malgouyres:
  Graphs Generalizing Closed Curves with Linear Construction of the Hamiltonian Cycle - Parametrization of Discretized Curves. 189-249
  
• Martín Matamala:
  Recursive Construction of Periodic Steady State for Neural Networks. 251-267
  
• John Harrison:
  Dynamical Properties of PWD0L Systems. 269-284
  
• Giora Slutzki, Sándor Vágvölgyi:
  Deterministic Top-Down Tree Transducers with Iterated Lookahead. 285-308
  
• Zhi-Zhong Chen:
  The Maximal f-Dependent Set Problem for Planar Graphs is in NC. 309-318
  
• Aviezri S. Fraenkel, Alan Jaffray, Anton Kotzig, Gert Sabidussi:
  Modular Nim. 319-333
  
• Xaver Gubás, Juraj Hromkovic, Juraj Waczulík:
  A Nonlinear Lower Bound on the Practical Combinational Complexity. 335-342
  
• Wojciech Rytter:
  Context-Free Recognition via Shortest Paths Computation: A Version of Valiant's Algorithm. 343-352
  
• Louxin Zhang:
  On the Approximation of Longest Common Nonsupersequences and Shortest Common Nonsubsequences. 353-362
  

Last update Thu May 23 19:35:28 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page