Abstract is missing.
- Geometry of Numbers and Integer Programming (Summary)Claus-Peter Schnorr. 1-7
- Getting Back to the Past in the Union-Find ProblemGiorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo. 8-17
- On the Construction of Optimal Time Adders (Extended Abstract)Bernd Becker, Reiner Kolla. 18-28
- On Computations with Integer DivisionBettina Just, Friedhelm Meyer auf der Heide, Avi Wigderson. 29-37
- Maintaining Range Trees in Secondary Memory (Extended Abstract)Mark H. Overmars, Michiel H. M. Smid. 38-51
- Solving Parametric Problems on TreesDavid Fernández-Baca, Giora Slutzki. 52-60
- On the k-Colouring of Circle-GraphsWalter Unger. 61-72
- Functional Equations for Data StructuresFrançois Bergeron, Gilbert Labelle, Pierre Leroux. 73-80
- The Power of Polynomial Size Omega-Branching ProgramsChristoph Meinel. 81-90
- Collapsing Oracle Hierarchies, Census Functions and Logarithmically Many QueriesUwe Schöning, Klaus W. Wagner. 91-97
- Domino Games with an Application to the Complexity of Boolean Algebras with Bounded Quantifier AlternationsErich Grädel. 98-107
- An Automatic Speed-up of Random Access Machines with Powerful Arithmetic InstructionsIngolf Wald. 108-117
- Characterizing the Polynomial Hierarchy by Alternating Auxiliary Pushdown AutomataBirgit Jenner, Bernd Kirsig. 118-125
- Hotz-Isomorphism Theorems in Formal Language TheoryVolker Diekert, Axel Möbus. 126-135
- First-Order Properties of Trees, Star-Free Expressions, adn AperiodicityUschi Heuter. 136-148
- Cyclic Rational Transductions and Polynomials of Rational FunctionsAlain Terlutte. 149-158
- Construction of a Family of Finite Maximal CodesClelia de Felice. 159-169
- Fonctions Génératrices Transcendantes à Coefficients Engendrés par AutomatesJean-Paul Allouche, Bernard Rande, Loÿs Thimonier. 170-183
- The Relation of Two Patterns with Comparable LanguagesGilberto Filé. 184-192
- Hierarchical Contextual Rewriting with Several LevelsWadoud Bousdira, Jean-Luc Remy. 193-206
- Generalized Bisimulation in Relational SpecificationsEgidio Astesiano, Alessandro Giovini, Gianna Reggio. 207-226
- On Polynomial Time Graph GrammarsFranz-Josef Brandenburg. 227-236
- An Axiomatic Definition of Context-Free Rewriting and its Application to NLC Graph GrammarsBruno Courcelle. 237-247
- Efficient Distributed Algorithms by Using the Archemedean Time AssumptionPaul G. Spirakis, Basil Tampakas. 248-263
- A Simple Protocol for Secure Circuit EvaluationMartín Abadi, Joan Feigenbaum. 264-272
- Scheduling Independent Jobs on HypercubesGuan-Ing Chen, Ten-Hwang Lai. 273-280
- Voronoi Diagrams Based on General Metrics in the PlaneRolf Klein, Derick Wood. 281-291
- Geometric Containment, Common Roots of Polynomials and Partial OrdersNicola Santoro, Stuart J. Sidney, Jorge Urrutia. 292-300
- Extension of the Notion of Map and Subdivisions of a Three-Dimensional SpacePascal Lienhardt. 301-311
- An Optimal Algorithm for Detecting Weak Visibility of a Polygon (Preliminary Version)Jörg-Rüdiger Sack, Subhash Suri. 312-321
- Polygon Placement Under Translation and RotationFrancis Avnaim, Jean-Daniel Boissonnat. 322-333
- On the Existence of the Minimum Asynchronous Automaton and on Decision Problems for Unambiguous Regular Trace LanguagesDanilo Bruschi, Giovanni Pighizzini, Nicoletta Sabadini. 334-345
- On Morphisms of Trace MonoidsEdward Ochmanski. 346-355
- An Automaton Characterization of Fairness in SCCSIrène Guessarian, Wafaa Niar-Dinedane. 356-372
- A Compositional Semantics for Concurrent PrologJoost N. Kok. 373-388
- Functions and Relations: The GRAAL SystemPatrick Bellot, Remi Legrand. 389-390
- LPC: A Concurrent Programming LaboratoryMarc V. Benveniste. 391-392
- Darwin: Computer Algebra and Enumerative CombinatoricsFrançois Bergeron, G. Cartier. 393-394
- Some Tools for an Inference Laboratory (ATINF)Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade. 395-396
- MODULOG and the MODULA WorkStationLouis Dewez, Jean-Michel Douin, Philippe Lucas. 397-398
- The Granules, Blutton: An Idea, an Algorithm to Implement on MultiprocessorB. Le Goff, Paul Le Guernic. 399-400
- Prototype de Venus: Un Outil d Aide à la Verification de Systemes CommunicantsAmelia Soriano. 401-402
- PLEXUS: A System for Implementing Hierarchical Graph AlgorithmsEgon Wanke. 403-404