Abstract is missing.
- Structuring and Modularizing Algebraic Specifications: The PLUSS Specification Language, Evolutions and PerspectivesMarie-Claude Gaudel. 3-18
- The Parallel Complexity of Tree Embedding Problems (Extended Abstract)Arvind Gupta, Naomi Nishimura. 21-32
- A Theory of Strict P-completenessAnne Condon. 33-44
- Fast and Optimal Simulations between CRCW PRAMsTorben Hagerup. 45-56
- Suitability of the Propositional Temporal Logic to Express Properties of Real-Time SystemsEric Nassor, Guy Vidal-Naquet. 59-70
- Axiomatizations of BacktrackingMichel Billaud. 71-82
- Joining k- and l-Recognizable Sets of Natural NumbersRoger Villemaire. 83-94
- On the Performance of Networks with Multiple BussesFriedhelm Meyer auf der Heide, Hieu Thien Pham. 97-108
- Efficient Algorithms for Solving Systems of Linear Equations and Path ProblemsVenkatesh Radhakrishnan, Harry B. Hunt III, Richard Edwin Stearns. 109-119
- Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free RecognitionLawrence L. Larmore, Wojciech Rytter. 121-132
- A Simplified Technique for Hidden-Line Elimination in TerrainsFranco P. Preparata, Jeffrey Scott Vitter. 135-146
- A Competitive Analysis of Nearest Neighbor Based Algorithms for Searching Unknown Scenes (Preliminary Version)Bala Kalyanasundaram, Kirk Pruhs. 147-157
- Equality and Disequality Constraints on Direct Subterms in Tree AutomataBruno Bogaert, Sophie Tison. 161-171
- Deterministic Regular LanguagesAnne Brüggemann-Klein, Derick Wood. 173-184
- The Extended Low Hierarchy Is an Infinite HierarchyMing-Jye Sheu, Timothy J. Long. 187-198
- Locally Definable Acceptance Types for Polynomial Time MachinesUlrich Hertrampf. 199-207
- The Theory of the Polynomial Many-One Degrees of Recursive Sets is UndecidableKlaus Ambos-Spies, André Nies. 209-218
- A Plane-Sweep Algorithm for Finding a Closest Pair Among Convex Planar ObjectsFrank Bartling, Klaus Hinrichs. 221-232
- Linear Approximation of Simple ObjectsJean-Marc Robert, Godfried T. Toussaint. 233-244
- Language Learning without OvergeneralizationShyam Kapur, Gianfranco Bilardi. 245-256
- The Log-Star RevolutionTorben Hagerup. 259-278
- Separating Counting Communication Complexity ClassesCarsten Damm, Matthias Krause, Christoph Meinel, Stephan Waack. 281-292
- A Nonlinear Lower Bound on the Practical Combinational ComplexityXaver Gubás, Juraj Hromkovic, Juraj Waczulík. 293-302
- Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2Jorge Castro, Carlos Seara. 305-317
- On Complexity Classes and Algorithmically Random Languages (Extended Abstract)Ronald V. Book, Jack H. Lutz, Klaus W. Wagner. 319-328
- New Time Hierarchy Results for Deterministic TMsKrzysztof Lorys. 329-336
- Unconditional Byzantine Agreement for any Number of Faulty ProcessorsBirgit Pfitzmann, Michael Waidner. 339-350
- Broadcasting in Butterfly and DeBruijn NetworksRalf Klasing, Burkhard Monien, Regine Peine, Elena Stöhr. 351-362
- Interval Approximations of Message Causality in Distributed ExecutionsClaire Diehl, Claude Jard. 363-374
- On the Approximability of the Maximum Common Subgraph ProblemViggo Kann. 377-388
- The Complexity of Colouring Circle Graphs (Extended Abstract)Walter Unger. 389-400
- Graph Isomorphism is Low for PPJohannes Köbler, Uwe Schöning, Jacobo Torán. 401-411
- A Simple Linear Time Algorithm for Triangulating Three-Colored GraphsHans Leo Bodlaender, Ton Kloks. 415-423
- On Locally Optimal Alignments in Genetic SequencesNorbert Blum. 425-436
- Secure Commitment Against A Powerful AdversaryRafail Ostrovsky, Ramarathnam Venkatesan, Moti Yung. 439-448
- Communication Efficient Zero-Knowledge Proofs of Knowledge (With Applications to Electronic Cash)Alfredo De Santis, Giuseppe Persiano. 449-460
- Four Results on Randomized Incremental ConstructionsKenneth L. Clarkson, Kurt Mehlhorn, Raimund Seidel. 463-474
- Enclosing Many Boxes by an Optimal Pair of BoxesBruno Becker, Paolo Giulio Franciosa, Stephan Gschwind, Thomas Ohler, Gerald Thiemt, Peter Widmayer. 475-486
- Performance Driven k-Layer WiringMichael Kaufmann, Paul Molitor, Wolfgang Vogelgesang. 489-500
- Synthesis for Testability: Binary Decision DiagramsBernd Becker. 501-512
- Compression and EntropyGeorges Hansel, Dominique Perrin, Imre Simon. 515-528
- Iterative Devices Generating Infinite WordsKarel Culik II, Juhani Karhumäki. 531-543
- On the Factorization ConjectureClelia de Felice. 545-556
- Conditional Seme-Thue Systems for Presenting MonoidsThomas Deiß. 557-565
- A Combinatorial Bound for Linear Programming and Related ProblemsMicha Sharir, Emo Welzl. 569-579
- In-place Linear Probing SortSvante Carlsson, Jyrki Katajainen, Jukka Teuhola. 581-587
- Speeding Up Two String-Matching AlgorithmsMaxime Crochemore, Thierry Lecroq, Artur Czumaj, Leszek Gasieniec, Stefan Jarominek, Wojciech Plandowski, Wojciech Rytter. 589-600
- The ANIGRAF SystemMichel Billaud. 603-604
- A Programming Language for Symbolic Computation of Regular Languages, Automata and SemigroupsJean-Marc Champarnaud. 605-606
- Mu-SPEED: A System for the Specification and Verification of MicroprocessorsHélène Collavizza. 607-608
- A Discrete Event Simulator of Communication Algorithms in Interconnection NetworksMiltos D. Grammatikakis, Jung-Sing Jwo. 609-610
- Alpha du Centaur: An Environment for the Design of Systolic ArraysHervé Le Verge. 611-612
- Verification of Communicating Processes by Means of Automata Reduction and AbstractionEric Madelaine, Didier Vergamini. 613-614
- Distributed System Simulator (DSS)Paul G. Spirakis, Basil Tampakas, Marina Papatriantafilou, K. Konstantoulis, K. Vlaxodimitropoulos, V. Antonopoulos, P. Kazazis, T. Metallidou, D. Spartiotis. 615-616
- An Interactive Proof Tool for Process AlgebrasHuimin Lin. 617-618
- SPECI90: A Term Rewriting and Narrowing SystemPeter Bachmann, Thomas Drescher, Sabine Nieke. 619-620