| Computational Geometry | p. 1 |
| Introductory Remarks | p. 2 |
| What is Computational Geometry? | p. 3 |
| Publishing in Computational Geometry | p. 7 |
| Shaving Logs | p. 10 |
| The 4-th Computational Geometry Symposium | p. 18 |
| Two Weeks Worth of Teaching | p. 22 |
| Two Small Results | p. 33 |
| Computational Geometry Research in Japan | p. 40 |
| Meetings in 1991 | p. 45 |
| Algebraic Specification | p. 49 |
| Introductory Remarks | p. 50 |
| On the Potential Role of Algebraic Specification within Computer Science | p. 51 |
| Some Initial Sections of the Algebraic Specification Tale | p. 54 |
| Memories of ADJ | p. 76 |
| Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software Systems | p. 82 |
| The Specification System OBSCURE: A Short Survey | p. 111 |
| Algebraic Specification and Formal Methods for Program Development: What are the Real Problems? | p. 115 |
| ESF-Concepts Linked with Algebraic Module Specifications | p. 121 |
| Linking Schemas and Module Specifications: A Proposal | p. 129 |
| Concepts and Compatibility Requirements for Implementations and Transformations of Specifications | p. 133 |
| New Compatibility Results for Implementations within the Initial Algebraic Approach | p. 149 |
| New Concepts for Amalgamation and Extension in the Framework of Specification Logics | p. 161 |
| Towards the Algebraic Specification of Classes in Object Oriented Programming | p. 183 |
| Restriction Constructions in Specification Logics | p. 195 |
| Towards an Algebraic Specification Framework for the VLSI Design Process | p. 202 |
| A Short Oxford Survey of Order Sorted Algebra | p. 209 |
| Logic in Computer Science | p. 223 |
| Introductory Remarks | p. 224 |
| On Kolmogorov Machines and Related Issues | p. 225 |
| Infinite Games | p. 235 |
| The Challenger-Solver Game: Variations on the Theme of P = NP | p. 245 |
| On the Classical Decision Problem | p. 254 |
| Evolving Algebras: an Attempt to Discover Semantics | p. 266 |
| Zero-One Laws | p. 293 |
| Topoi and Computation | p. 310 |
| Lower Bounds for the Complexity of Theories | p. 318 |
| Forms of Semantic Specification | p. 332 |
| Declarative Semantics of Logic Programming | p. 354 |
| A Brief Guide to Linear Logic | p. 377 |
| Structural Complexity | p. 395 |
| Introductory Remarks | p. 396 |
| A Retrospective on Structural Complexity | p. 397 |
| Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial Hierarchy | p. 403 |
| Collapsing Hierarchies | p. 412 |
| Some Observations about Relativization of Space Bounded Computations | p. 423 |
| On the Importance of Being [actual symbol not reproducible]-Hard | p. 435 |
| Godel, von Neumann and the P = ? NP Problem | p. 445 |
| A View of Structural Complexity Theory | p. 451 |
| Counting Hierarchies: Polynomial Time and Constant Depth Circuits | p. 469 |
| On IP = PSPACE and Theorems with Narrow Proofs | p. 484 |
| On Unique Satisfiability and Randomized Reductions | p. 494 |
| Complexity Classes for Partial Functions | p. 504 |
| Is #P Closed Under Subtraction | p. 523 |
| Relativization: a Revisionistic Retrospective | p. 537 |
| Formal Language Theory | p. 549 |
| Introductory Remarks | p. 550 |
| In the Prehistory of Formal Language Theory: Gauss Languages | p. 551 |
| What Emil Said About the Post Correspondence Problem | p. 563 |
| Decidability in Finite Automata | p. 572 |
| Games played on the Plane: Solitaire and Cellular Automata | p. 579 |
| The Impact of the DOL Problem | p. 586 |
| L Codes and L Systems with Immigration | p. 595 |
| Parallel Communicating Grammar Systems | p. 603 |
| Density in Discrete Systems | p. 616 |
| Table of Contents provided by Blackwell. All Rights Reserved. |