Abstract is missing.
- Propositional Proof Complexity: Past, Present, and FuturePaul Beame, Toniann Pitassi. 42-70
- Twelve Problems in Resource-Bounded MeasureJack H. Lutz, Elvira Mayordomo. 83-101
- DiagonalizationLance Fortnow. 102-114
- Theory and Practice of Software Development: A Review of Driving Forces and Expectations of TAPSOFT from 1985 to 1997Hartmut Ehrig, Bernd Mahr. 118-130
- Algebraic Techniques in Software Development: A Review of Progress up to the Mid NinetiesHartmut Ehrig, Bernd Mahr. 134-152
- CoFI: The Common Framework Initiative for Algebraic Specification and DevelopmentPeter D. Mosses. 153-163
- GETGRATS and APPLIGRAPH: Theory and Applications of Graph TransformationAndrea Corradini, Hans-Jörg Kreowski. 164-170
- Dynamic Abstract Data Types: An Informal Proposal in 1994Hartmut Ehrig, Fernando Orejas. 180-191
- Integration Paradigm for Data Type and Process Specification TechniquesHartmut Ehrig, Fernando Orejas. 192-201
- From Basic Views and Aspects to Integration of Specification FormalismsHartmut Ehrig, Julia Padberg, Fernando Orejas. 202-214
- On Formal Semantics and Integration of Object-Oriented Modeling LanguagesHartmut Ehrig, Robert Geisler, Martin Große-Rhode, Marcus Klar, Stefan Mann. 226-232
- AMAST 91 Banquet TalkYuri Gurevich. 247-253
- Logic on WordsJean-Eric Pin. 254-273
- Herbrand s Theorem and Equational Reasoning: Problems and SolutionsAnatoli Degtyarev, Yuri Gurevich, Andrei Voronkov. 303-326
- From Invariants to CanonizationYuri Gurevich. 327-331
- The Complexity of Propositional ProofsAlasdair Urquhart. 332-342
- Functions Versus AlgorithmsLoïc Colson. 343-362
- Why are Modal Logics so Robustly Decidable?Erich Grädel. 393-408
- The Underlying Logic of Hoare LogicAndreas Blass, Yuri Gurevich. 409-436
- Does Concurrency Theory Have Anything to Say About Parallel Programming?Prakash Panangaden. 439-446
- Towards Global Computations Guided by Concurrency TheoryBent Thomsen, Lone Leth Thomsen. 460-468
- What is Branching Time Semantics and Why to Use it?Rob J. van Glabbeek. 469-479
- More Infinite ResultsOlaf Burkart, Javier Esparza. 480-503
- Conservative Extension in Structural Operational SemanticsLuca Aceto, Wan Fokkink, Chris Verhoef. 504-524
- Security Analysis Using Flow LogicsChiara Bodei, Pierpaolo Degano, Flemming Nielson, Hanne Riis Nielson. 525-542
- Theory of Genetic AlgorithmsThomas Bäck, Jeannette M. de Graaf, Joost N. Kok, Walter A. Kosters. 546-578
- Why Evolutionary Algorithms?David B. Fogel, Zbigniew Michalewicz. 579-602
- Natural Data Mining TechniquesJoost N. Kok, Walter A. Kosters. 603-613
- Theoretical and Experimental DNA ComputationMartyn Amos. 614-630
- Quantum Computing and Communication ComplexityHarry Buhrman. 664-679
- Many-Valued Truth Functions, Cernys Conjecture, and Road ColoringAlexandru Mateescu, Arto Salomaa. 693-707
- Simple Words in Equality SetsMarjo Lipponen, Arto Salomaa. 717-733
- Words on TrajectoriesAlexandru Mateescu. 752-770
- Networks of Language ProcessorsErzsébet Csuhaj-Varjú. 771-790
- Networks of Language Processors: Parallel Communicating SystemsErzsébet Csuhaj-Varjú, Arto Salomaa. 791-810