Abstract is missing.
- Models, Languages, and Compiler Technology for High Performance ComputersThomas Cheatham. 3-26
- On NC-Real Complexity Classes for Additive Circuits and Their Relations with NCMichel Cosnard, Martín Matamala. 27-37
- E-Complete Sets Do Not Have Optimal Polynomial Time ApproximationsPavol Duris, José D. P. Rolim. 38-51
- Solving Polynomial Fixed Point EquationsStephen L. Bloom, Zoltán Ésik. 52-67
- Capturing Complexity Classes with Lindström QuantifiersJohann A. Makowsky. 68-71
- Communication Throughput of Interconnection NetworksBurkhard Monien, Ralf Diekmann, Reinhard Lüling. 72-86
- Intuitive Counterexamples for Constructive FallaciesJames Lipton, Michael J. O Donnell. 87-111
- Algebraic Methods in the Compositional Analysis of Logic ProgramsFernando Orejas, Elvira Pino, Hartmut Ehrig. 112-126
- Longest Common SubsequencesMike Paterson, Vlado Dancík. 127-142
- Towards DNA Sequencing ChipsPavel A. Pevzner, Robert J. Lipshutz. 143-158
- On-Line Scheduling of Parallel JobsJiri Sgall. 159-176
- Stable Bistructure Models of PCFGlynn Winskel. 177-197
- A Competitive Analysis of the List Update Problem with LookaheadSusanne Albers. 201-210
- May and Must Convergencey in Concurrent Lambda-CalculusFabio Alessi, Mariangiola Dezani-Ciancaglini, Ugo de Liguoro. 211-220
- Genericity and Measure for Exponential TimeKlaus Ambos-Spies, Hans-Christian Neis, Sebastiaan Terwijn. 221-232
- Analysis of Bounded DisorderRicardo A. Baeza-Yates. 233-244
- On Languages Accepted with Simultaneous Complexity Bounds and Their Ranking ProblemAlberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini. 245-255
- A Proof System for Asynchronously Communicating Deterministic ProcessesFrank S. de Boer, M. van Hulst. 256-265
- Embedding Complete Binary Trees into Star NetworksA. Bouabdallah, Marie-Claude Heydemann, Jaroslav Opatrny, Dominique Sotteau. 266-275
- Inductive Counting Below LOGSPACECarsten Damm, Markus Holzer. 276-285
- Decision Problems for Edge GrammarsJürgen Dassow. 286-295
- The Big Sweep : On the Power of the Wavefront Approach to Voronoi DiagramsFrank K. H. A. Dehne, Rolf Klein. 296-305
- Reliable Minimum Finding Comparator NetworksPiotr Denejko, Krzysztof Diks, Andrzej Pelc, Marek Piotrów. 306-315
- On Parallel Complexity of Maximum f-matching and the Degree Sequence ProblemAnders Dessmark, Andrzej Lingas, Oscar Garrido. 316-325
- A Comparison of Two Lower Bound Methods for Communication ComplexityMartin Dietzfelbinger, Juraj Hromkovic, Georg Schnitger. 326-335
- Efficient Solving of the Word Equations in One VariableS. Eyono Obono, Pavel Goralcik, M. N. Maksimenko. 336-341
- A Pi-Calculus with Explicit Substitutions: the Late SemanticsGian Luigi Ferrari, Ugo Montanari, Paola Quaglia. 342-351
- Processes and HyperuniversesMichael Forti, Furio Honsell, Marina Lenisa. 352-363
- The Combinatorial Complexity of a Finite StringFelix Frayman, Valery Kanevsky, Walter W. Kirchherr. 364-372
- A Fully Abstract Semantics for Termination in Petri NetsRobert Gold. 373-382
- Passive and Active Rules in Deductive DatabasesMirian Halfeld Ferrari Alves, Dominique Laurent, Nicolas Spyratos. 383-392
- Combinatorial Results on the Complexity of Teaching and LearningTibor Hegedüs. 393-402
- Degrees and Reducibilities of Easy Tally SetsMontserrat Hermo. 403-412
- MSO Definable Text LanguagesHendrik Jan Hoogeboom, Paulien ten Pas. 413-422
- Two Lower Bounds on Distributive Generation of LanguagesJuraj Hromkovic, Jarkko Kari, Lila Kari, Dana Pardubská. 423-432
- Rational RewritingPaola Inverardi, Marisa Venturini Zilli. 433-442
- On the Size of Independent Systems of Equations in SemigroupsJuhani Karhumäki, Wojciech Plandowski. 443-452
- On a Sublinear Time Parallel Construction of Optimal Binary Search TreesMarek Karpinski, Wojciech Rytter. 453-461
- Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel Solution of Shortest Paths and Other ProblemsDimitris J. Kavvadias, Grammati E. Pantziou, Paul G. Spirakis, Christos D. Zaroliagis. 462-472
- The Relationship Between Gossiping in Vertex-Disjoint Paths Mode and Bisection WidthRalf Klasing. 473-483
- A Comparison of Finite and Cellular AutomataPetr Kurka. 484-493
- Empty AlternationKlaus-Jörn Lange, Klaus Reinhardt. 494-503
- On the Minimization Prolem for Omega-AutomataBertrand Le Saëc, Igor Litovsky. 504-514
- On the Complexity of Constructing Optimal Ordered Binary Decision DiagramsChristoph Meinel, Anna Slobodová. 515-524
- Approximation Algorithms for Min-k-overlap Problems Using the Principal Lattice of Partitions ApproachH. Narayanan, Subir Roy, Sachin B. Patkar. 525-535
- A Completeness Theorem fro Nondeterministic Kleene AlgebrasRocco De Nicola, Anna Labella. 536-545
- How a Rainbow Coloring Function Can Simulate Wait-Free HandshakingMarina Papatriantafilou, Philippas Tsigas. 546-555
- Critical Pairs in Term Graph RewritingDetlef Plump. 556-566
- Read-Write CausalityCorrado Priami, Daniel Yankelevich. 567-576
- Some Trace Monoids Where Both the Star Problem and the Finite Power Property Problem are DecidableGwénaël Richomme. 577-586
- Complexity of E0L Structural EquivalenceKai Salomaa, Derick Wood, Sheng Yu. 587-596
- Shorter Queues for Permutation Routing on MeshesJop F. Sibeyn, Bogdan S. Chlebus, Michael Kaufmann. 597-607
- Full Abstraction for the Second Order Subset of an Algol-Like LanguageKurt Sieber. 608-617
- The Finest Homophonic Partition and Related Code ConceptsAndreas Weber, Tom Head. 618-628