Theoretical Computer Science, Volume 169

Volume 169, Number 1, 30 November 1996

• C. Barry Jay, John Staples:
  Preface: Theoretical Computer Science in Australia and New Zealand. 1
• Martin W. Bunder:
  Lambda Terms Definable as Combinators. 3-21
  
• Peter Eades, Sue Whitesides:
  The Logic Engine and the Realization Problem for Nearest Neighbor Graphs. 23-37
  
• Craig A. Farrell, Dorota H. Kieronska:
  Formal Specification of Parallel SIMD Execution. 39-65
  
• Jeremy Gibbons:
  Computing Downwards Accumulations on Trees Quickly. 67-80
  
• Peter Nickolas, Peter J. Robinson:
  The Qu-Prolog Unification Algorithm: Formalisation and Correctness. 81-112
  
• La Monte H. Yarroll:
  See More Through Lenses Than Bananas. 113-121
  

Volume 169, Number 2, 5 December 1996

• Anca Muscholl:
  On the Complementation of Asynchronous Cellular Büchi Automata. 123-145
  
• Uriel Feige:
  A Fast Randomized LOGSPACE Algorithm for Graph Connectivity. 147-160
  
• Noa Globerman, David Harel:
  Complexity Results for Two-Way and Multi-Pebble Automata and their Logics. 161-184
  
• Jean-Eric Pin:
  Polynomial Closure of Group Languages and Open Sets of the Hall Topology. 185-200
  
• Roberto Di Cosmo, Delia Kesner:
  Combining Algebraic Rewriting, Extensional Lambda Calculi, and Fixpoints. 201-220