Abstract is missing.
- Computational GeometryHerbert Edelsbrunner. 1-2 [doi]
- Computational GeometryHerbert Edelsbrunner. 3-48 [doi]
- Algebraic SpecificationHartmut Ehrig. 49-50 [doi]
- On the potential Role of Algebraic Specification within Computer ScienceHartmut Ehrig, Peter Pepper. 51-53 [doi]
- Some initial sections of the Algebraic Specification TaleHans-Jörg Kreowski. 54-75 [doi]
- Memories of ADJJoseph A. Goguen. 76-81 [doi]
- Overview of Algebraic Specification Languages, Environments and Tools, and Algebraic Specifications of Software SystemsHartmut Ehrig, Ingo Clabetaen. 82-110 [doi]
- Obscure: a Short SurveyJacques Loeckx. 111-114 [doi]
- Algebraic specification and formal methods for program development: what are the real problems?Donald Sannella, Andrzej Tarlecki. 115-120 [doi]
- ESF-Concepts Linked with Algebraic Module SpecificationsHartmut Ehrig. 121-128 [doi]
- Linking Schemas and Module Specifications: a ProposalHartmut Ehrig, Michael A. Arbib. 129-132 [doi]
- Concepts and Compatibility Requirements for Implementations and Transformations of SpecificationsHartmut Ehrig. 133-148 [doi]
- New Compatibility Results for Implementations within the Initial Algebraic ApproachHartmut Ehrig, Helmut Adametz. 149-160 [doi]
- New Concepts for Amalgamation and Extension in the Framework of Specification LogicsHartmut Ehrig, Michael Baldamus, Fernando Orejas. 161-182 [doi]
- Towards the Algebraic Specification of Classes in Object Oriented ProgrammingFrancesco Parisi-Presicce, Alfonso Pierantonio. 183-194 [doi]
- Restriction Constructions in Specification LogicsMartin Grobetae-Rhode, Hartmut Ehrig. 195-201 [doi]
- Towards an Algebraic Specification Framework for the VLSI Design ProcessP. S. Subramanian. 202-208 [doi]
- A Short Oxford Survey of Order Sorted AlgebraJoseph A. Goguen, Razvan Diaconescu. 209-222 [doi]
- Logic in Computer ScienceYuri Gurevich. 223-224 [doi]
- On Kolmogorov Machines and Related IssuesYuri Gurevich. 225-234 [doi]
- Infinite GamesYuri Gurevich. 235-244 [doi]
- The challenger-Solver Game: variations on the Theme of P=NPYuri Gurevich. 245-253 [doi]
- On the Classical Decision ProblemYuri Gurevich. 254-265 [doi]
- Evolving Algebras: an Attempt to Discover SemanticsYuri Gurevich. 266-292 [doi]
- Zero-One LawsYuri Gurevich. 293-309 [doi]
- Topoi and ComputationAndreas Blass. 310-317 [doi]
- Lower Bounds for the Complexity of TheoriesKevin J. Compton. 318-331 [doi]
- Forms of Semantic SpecificationCarl A. Gunter. 332-353 [doi]
- Declarative Semantics of Logic ProgrammingKenneth Kunen. 354-376 [doi]
- A Brief Guide to Linear LogicAndre Scedrov. 377-394 [doi]
- Structural ComplexityJuris Hartmanis. 395-396 [doi]
- A Retrospective on Structural ComplexityJuris Hartmanis. 397-402 [doi]
- Sparse Complete Sets for NP and the Optimal Collapse of the Polynomial HierarchyJuris Hartmanis. 403-411 [doi]
- Collapsing HierarchiesJuris Hartmanis. 412-422 [doi]
- Some Observations about Relativization of Space Bounded ComputationsJuris Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell. 423-434 [doi]
- 2-HardJuris Hartmanis. 435-444 [doi]
- Gödel, von Neumann and the P =? NP ProblemJuris Hartmanis. 445-450 [doi]
- A View of Structural Complexity TheoryRonald V. Book, Osamu Watanabe 0001. 451-468 [doi]
- Counting Hierarchies: Polynomial Time and Constant Depth CircuitsEric Allender, Klaus W. Wagner. 469-483 [doi]
- On IP = PSPACE and Theorems with Narrow ProofsJuris Hartmanis, Richard Chang, Desh Ranjan, Pankaj Rohatgi. 484-493 [doi]
- On Unique Satisfiability and Randomized ReductionsRichard Chang, Pankaj Rohatgi. 494-503 [doi]
- Complexity Classes for Partial FunctionsAlan L. Selman. 504-522 [doi]
- Is #P Closed Under Subtraction?Lane A. Hemachandra, Mitsunori Ogiwara. 523-536 [doi]
- Relativization: a Revisionistic RetrospectiveJuris Hartmanis, Richard Chang, Suresh Chari, Desh Ranjan, Pankaj Rohatgi. 537-548 [doi]
- Formal Language TheoryArto Salomaa. 549-550 [doi]
- In the prehistory of formal language theory: Gauss languagesLila Kari, Solomon Marcus, Gheorghe Paun, Arto Salomaa. 551-562 [doi]
- What Emil said about the Post Correspondence ProblemArto Salomaa. 563-571 [doi]
- Decidability in Finite AutomataArto Salomaa. 572-578 [doi]
- Games played on the plane : Solitaire & Cellular AutomataJarkko Kari. 579-585 [doi]
- The Impact of the DOL ProblemJuhani Karhumäki. 586-594 [doi]
- L codes and L Systems with immigrationArto Salomaa. 595-602 [doi]
- Parallel Communicating Grammar SystemsLila Santean. 603-615 [doi]
- Density in discrete systemsValtteri Niemi. 616-626 [doi]