Abstract is missing.
- Discrete Time Process Algebra with AbstractionJos C. M. Baeten, Jan A. Bergstra. 1-15
- A Duration Calculus with Infinite IntervalsChaochen Zhou, Dang Van Hung, Xiaoshan Li. 16-41
- A Delegation-based Object Calculus with SubtyingKathleen Fisher, John C. Mitchell. 42-61
- Model-Checking for Real-Time SystemsKim Guldstrand Larsen, Paul Pettersson, Wang Yi. 62-88
- On Polynomial Ideals, Their Complexity, and ApplicationsErnst W. Mayr. 89-105
- From a Concurrent Lambda-Calculus to the Pi-CalculusRoberto M. Amadio, Lone Leth, Bent Thomsen. 106-115
- Rewriting Regular Inequalities (Extended Abstract)Valentin M. Antimirov. 116-125
- A Simple Abstract Semantics for Equational TheoriesGilles Barthe. 126-135
- Processes with Multiple Entries and ExitsJan A. Bergstra, Gheorghe Stefanescu. 136-145
- Efficient Rewriting in Cograph Trace MonoidsMichael Bertol. 146-155
- Effective Category and Measure in Abstract Complexity Theory (Extended Abstract)Cristian Calude, Marius Zimand. 156-170
- About Planar Cayley GraphsThomas Chaboud. 171-180
- On Condorcet and Median Points of Simple Rectilinear Polygons (Extended Abstract)Victor Chepoi, Feodor F. Dragan. 181-190
- Fast Algorithms for Maintaining Shortest Paths in Outerplanar and Planar DigraphsHristo Djidjev, Grammati E. Pantziou, Christos D. Zaroliagis. 191-200
- r-Domination Problems on Homogeneously Ordered Graphs (Extended Abstract)Feodor F. Dragan, Falk Nicolai. 201-210
- Growing Patterns in 1D Cellular AutomataBruno Durand, Jacques Mazoyer. 211-220
- Petri Nets, Commutative Context-Free Grammars, and Basic Parallel ProcessesJavier Esparza. 221-232
- Implementation of a UU-Algorithm for Primitive Recursive Tree FunctionsHeinz Faßbender. 233-242
- Dummy Elimination: Making Termination EasierMaria C. F. Ferreira, Hans Zantema. 243-252
- Computing Petri Net Languages by ReductionsAnja Gronewold, Hans Fleischhack. 253-262
- Categorial Graphs (Extended Abstract)Erik de Haas. 263-272
- Effective Systolic Algorithms for Gossiping in Cycles and Two-Dimensional Grids (Extended Abstract)Juraj Hromkovic, Ralf Klasing, Dana Pardubská, Walter Unger, Juraj Waczulík, Hubert Wagener. 273-282
- Restarting AutomataPetr Jancar, Frantisek Mráz, Martin Plátek, Jörg Vogel. 283-292
- Optimal Continguous Expression DAG EvaluationsChristoph W. Keßler, Thomas Rauber. 293-302
- Communication as Unification in the Petri Box CalculusHanna Klaudel, Elisabeth Pelz. 303-312
- Distributed Catenation and Chomsky HierarchyManfred Kudlek, Alexandru Mateescu. 313-322
- The Power of Frequency Computation (Extended Abstract)Martin Kummer, Frank Stephan. 323-332
- Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space (Extended Abstract)Ngoc-Minh Lê. 333-342
- Properties of Probabilistic Pushdown Automata (Extended Abstract)Ioan I. Macarie, Mitsunori Ogihara. 343-352
- Formal Parametric EquationsG. S. Makanin, Habib Abdulrab, M. N. Maksimenko. 353-362
- PRAM s Towards Realistic Parallelism: BRAM sRolf Niedermeier, Peter Rossmanith. 363-373
- Some Results Concerning Two-Dimensional Turing Machines and Finite AutomataH. Petersen. 374-382
- How Hard is to Compute the Edit DistanceGiovanni Pighizzini. 383-392
- On the Synchronization of Semi-TracesKlaus Reinhardt. 393-403
- Tiling with Bars and Satisfaction of Boolean FormulasEric Rémila. 404-413
- Axiomatizing Petri Net Concatenable ProcessesVladimiro Sassone. 414-423
- Functional Sorts in Data Type Specifications: A Geometric Approach to SemanticsKlaus-Dieter Schewe. 424-433