edited by G Rozenberg (University of Leiden) & A Salomaa (University Turku)

The book is a very up-to-date collection of articles in theoretical computer science, written by leading authorities in the field. The topics range from algorithms and complexity to algebraic specifications, and from formal languages and language-theoretic modeling to computational geometry. The material is based on columns and articles that have appeared in the EATCS Bulletin during the past two to three years. Although very recent research is discussed, the largely informal style of writing makes the book accessible to readers with little or no previous knowledge of the topics.

• Computational Geometry (H Edelsbrunner et al.)
• Algebraic Specification (H Ehrig et al.):
  • On the Potential Role of Algebraic Specification within Computer Science (H Ehrig & P Pepper)
  • Linking Schemas and Module Specifications: A Proposal (H Ehrig & M A Arbib)
  • A Short Oxford Survey of Order Sorted Algebra (J Goguen & R Diaconescu)
• Logic in Computer Science (Y Gurevich et al.):
  • On Kolmogorov Machines and Related Issues
  • Topoi and Computation (A Blass)
• Structural Complexity (J Hartmanis et al.):
  • Gödel, von Neumann and the P = ? NP Problem
  • Counting Hierarchies: Polynomial Time and Constant Depth Circuits (E W Allender & K W Wagner)
• Formal Language Theory (A Salomaa et al.):
  • Decidability in Finite Automata
  • Parallel Communicating Grammar Systems (L Santean)
  • and other papers