Preface (M. Karpinksi and J. Van Leeuwen). Input-Driven Languages are Recognized in log n Space (B. v. Braunmuehl and R. Verbeek). Constructive Mathematics as a Programming Logic I: Some Principles of Theory (R.L. Constable). Space and Reversal Complexity of Probabilistic One-Way Turing Machines (R. Freivalds). Recurring Dominoes: Making the Highly Undecidable Highly Understandable (D. Harel). A New Transformational Approach to Partial Correctness Proof Calculi for Algol 68-like Programs with Finite Modes and Simple Side Effects (H. Langmaack). Effective Determination of the Zeros of p-ADIC Exponential Functions (A. MacIntyre). The Logic of Games and Its Applications (R. Parikh). A Fast Parallel Construction of Disjoint Paths in Networks (E. Shamir and E. Upfal). Descriptional Complexity for Classes of Ianov-Schemes (P. Trum and D. Wotschke).