Abstract is missing.
- Polymorphism, Parameterization and Typing: An Algebraic Specification PerspectiveJacek Leszczylowski, Martin Wirsing. 1-15
- Executable Higher-Order Algebraic SpecificationsJean-Pierre Jouannaud. 16-25
- Efficient Memory Access in Large-Scale ComputationJeffrey Scott Vitter. 26-41
- l-Occurrences of Avoidable PatternsPeter Roth. 42-49
- Rational Ralations with Bounded DelayChristiane Frougny, Jacques Sakarovitch. 50-63
- On the Power of Several QueuesMartin Schmidt. 64-75
- On Aperiodic Trace LanguagesGiovanna Guaiana, Antonio Restivo, Sergio Salemi. 76-88
- Recognizable and Rational Languages of Finite and Infinite TracesPaul Gastin. 89-104
- On the Concatenation of Infinite TracesVolker Diekert. 105-117
- Tight RNC Approximations to Max FlowMaria J. Serna, Paul G. Spirakis. 118-126
- A Natural Metric for Curves - Computing the Distance for Polygonal Chains and Approximation AlgorithmsMichael Godau. 127-136
- The Worst Case Complexity of McDiarmid and Reed s Variant of Bottom-Up-Heap Sort is Less Than n log n + 1.1nIngo Wegener. 137-147
- Decision Problems for Term Rewriting Systems and Recognizable Tree LanguagesRémi Gilleron. 148-159
- Decidable Sentences for Context-Free GroupsKlaus Madlener, Friedrich Otto. 160-171
- The Owner Concept for PRAMsPeter Rossmanith. 172-183
- Actors as a Parallel Programming ModelFrançoise Baude, Guy Vidal-Naquet. 184-195
- Average Case Analysis of Unification AlgorithmsLuc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann. 196-213
- Methodology for Proving the Termination of Logic ProgramsBal Wang, R. K. Shyamasundar. 214-227
- Polynomial Size Constant Depth Circuits with a Limited Number of NegationsMiklos Santha, Christopher B. Wilson. 228-237
- Randomized Polynomials, Threshold Circuits, and the Polynomial HierarchyJun Tarui. 238-250
- Computationally Convincing Proofs of KnowledgeGilles Brassard, Claude Crépeau, Sophie Laplante, Christian Léger. 251-262
- Interactive Proof Systems and Alternating Time-Space ComplexityLance Fortnow, Carsten Lund. 263-274
- Optimal Tradeoffs Between Time And Bit Complexity In Distributed Synchronous RingsBernd Schmeltz. 275-284
- Unconditional Byzantine Agreement with Good MajorityBirgit Baum-Waidner, Birgit Pfitzmann, Michael Waidner. 285-295
- A New Compacting Garbage-Collection Algorithm with a Good Average-Case PerformanceSvante Carlsson, Christer Mattsson, Patricio V. Poblete, Mats Bengtsson. 296-308
- Bisimulation and Action RefinementWalter Vogler. 309-321
- Testing for Unboundedness of FIFO ChannelsThierry Jéron. 322-333
- Detection of Deadlocks in an Infinite Family of NetsJoffroy Beauquier, Annie Choquet, Antoine Petit, Guy Vidal-Naquet. 334-347
- Nondterminism Within PJonathan F. Buss, Judy Goldsmith. 348-359
- Structure and Importance of Logspace-MOD-ClassesGerhard Buntrock, Carsten Damm, Ulrich Hertrampf, Christoph Meinel. 360-371
- Complexity Classification of Truth Maintenance SystemsVladislav Rutenburg. 372-383
- Reachability in Reversible Free Choice SystemsJörg Desel, Javier Esparza. 384-397
- Compositional Generation of Home States in Free Choice SystemsEike Best, Ludmila Cherkasova, Jörg Desel. 398-409
- Bounded ReductionsHarry Buhrman, Edith Spaan, Leen Torenvliet. 410-421
- Functional Oracle Queries as a Measure of Parallel TimeCarme Àlvarez, José L. Balcázar, Birgit Jenner. 422-433
- Optimal Parallel Recognition of Bracket Languages on HypercubesGisela Pitsch, Elmar Schömer. 434-443
- Constant Queue Routing on a MeshSanguthevar Rajasekaran, Richard Overholt. 444-455
- The Complexity of the Max Word ProblemAnne Condon. 456-465
- The Expressive Power of Second Order Horn LogicErich Grädel. 466-477
- Tight Bounds on the Path Length of Binary TreesAlfredo De Santis, Giuseppe Persiano. 478-487
- The Random Testability of the n-Input AND GateJoachim Hartmann. 488-498
- An Observational Subset of First-Order Logic Cannot Specify the Behaviour of a Counter (Extended Abstract)Oliver Schoett. 499-510
- Unfolding, Procedural and Fixpoint Semantics of Logic ProgramsFrançois Denis, Jean-Paul Delahaye. 511-522
- A Modal Semantics for the Negation as Failure and the Closed World Assumption RulesPhilippe Balbiani. 523-534
- The RELVIEW-SystemRudolf Berghammer, Gunther Schmidt. 535-536
- Geometry Models Design System GammaPOME. V. Biryalcev, A. M. Gusenkov, Ildar R. Nasyrov, A. A. Saveliev. 537-538
- The PROSPECTRA SystemBerthold Hoffmann, Bernd Krieg-Brückner. 539-540
- Prototype of a Verification ToolThierry Jéron. 541-542
- IPG - An Interactive Parser GeneratorJörg Kröger, Lothar Schmitz. 543-544
- A Placement System for Constrained Blocks with Flexible ShapesSimone Pimont. 545-546
- Algebraic Program Interpreter APREX2D. Rayko, Kirill Vershinin, Igor Romanenko. 547-548