13. ICALP 1986: Rennes, France

• Eric Allender:
  Characterizations on PUNC and Precomputation (Extended Abstract). 1-10
  
• Didier Arquès, Jean Françon, M. T. Guichet, P. Guichet:
  Comparison of Algorithms Controlling Concurrent Access to a Database: A Combinatorial Approach. 11-20
  
• Franz Aurenhammer:
  A New Duality Result Concerning Voronoi Diagrams. 21-30
  
• Amir Averbuch, Shmuel Winograd, Zvi Galil:
  Classification of all the Minimal Bilinear Algorithms for Computing the Coefficients of the Product of Two Polynomials Modulo a Polynomial. 31-39
  
• Ronald V. Book, Pekka Orponen, David A. Russo, Osamu Watanabe:
  On Exponential Lowness. 40-49
  
• Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson:
  A Tradeoff Between Search and Update Time for the Implicit Dictionary Problem. 50-59
  
• Franz-Josef Brandenburg:
  Intersections of Some Families of Languages. 60-68
  
• Janusz A. Brzozowski, Carl-Johan H. Seger:
  Correspondence between Ternary Simulation and Binary Race Analysis in Gate Networks (Extended Summary). 69-78
  
• Christian Choffrut, Marcel Paul Schützenberger:
  Counting with Rational Functions. 79-88
  
• Clelia de Felice:
  Finite Biprefix Sets of Path in a Graph. 89-94
  
• Patrick W. Dymond, Walter L. Ruzzo:
  Parallel RAMs with Owned Global Memory and Deterministic Context-Free Language Recognition (Extended Abstract). 95-104
  
• Laurent Fribourg:
  A Strong Restriction of the Inductive Completion Procedure. 105-115
  
• Pavel Goralcik, Václav Koubek:
  On Discerning Words by Automata. 116-122
  
• Juris Hartmanis, Lane A. Hemachandra:
  Complexity Classes Without Machines: On Complete Languages for UP. 123-135
  
• Juris Hartmanis, Ming Li, Yaacov Yesha:
  Containment, Separation, Complete Sets, and Immunity of Complexity Classes. 136-145
  
• Miki Hermann, Igor Prívara:
  On Nontermination of Knuth-Bendix Algorithm. 146-156
  
• Juraj Hromkovic:
  Tradeoffs for Language Recognition on Parallel Computing Models. 157-166
  
• J. Howard Johnson:
  Rational Equivalence Relations. 167-176
  
• Peter Kirschenhofer, Helmut Prodinger:
  Some Further Results on Digital Search Trees. 177-185
  
• Sarit Kraus, Daniel J. Lehmann:
  Knowledge, Belief and Time. 186-195
  
• Ten-Hwang Lai:
  A Termination Detector for Static and Dynamic Distributed Systems with Asynchronous Non-first-in-first-out Communication (Extended Abstract). 196-205
  
• Klaus-Jörn Lange:
  Decompositions of Nondeterministic Reductions (Extended Abstract). 206-214
  
• Thomas Lengauer:
  Hierarchical Planary Testing Algorithms. 215-225
  
• Björn Lisper:
  Synthesis and Equivalence of Concurrent Systems. 226-235
  
• Heikki Mannila, Esko Ukkonen:
  The Set Union Problem with Backtracking. 236-243
  
• Jean-Paul Mascle:
  Torsion Matrix Semigroups and Recognizable Transductions. 244-253
  
• Yves Métivier:
  On Recognizable Subsets of Free Partially Commutative Monoids. 254-264
  
• Burkhard Monien, Ivan Hal Sudborough:
  Min Cut is NP-Complete for Edge Weigthed Trees. 265-274
  
• David E. Muller, Ahmed Saoudi, Paul E. Schupp:
  Alternating Automata. The Weak Monadic Theory of the Tree, and its Complexity. 275-283
  
• Norbert Th. Müller:
  Subpolynomial Complexity Classes of Real Functions and Real Numbers. 284-293
  
• Jean-Pierre Pécuchet:
  Etude Syntaxique des Parties Reconnaissables de Mots Infinis. 294-303
  
• Iain Phillips:
  Refusal Testing. 304-313
  
• George M. Reed, A. W. Roscoe:
  A Timed Model for Communicating Sequential Processes. 314-323
  
• Kenneth W. Regan:
  A Uniform Reduction Theorem - Extending a Result of J. Grollmann and A. Selman. 324-333
  
• Louis E. Rosier, Hsu-Chun Yen:
  On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. 334-343
  
• Nir Shavit, Nissim Francez:
  A New Approach to Detection of Locally Indicative Stability. 344-358
  
• Claus-Peter Schnorr:
  A More Efficient Algorithm for Lattice Basis Reduction (Extended Abstract). 359-369
  
• Uwe Schöning:
  Lower Bounds by Recursion Theoretic Arguments (Extended Abstract). 370-375
  
• Klaus Simon:
  An Improved Algorithm for Transitive Closure on Acyclic Digraphs. 376-386
  
• Jean-Claude Spehner:
  Un Algorithme Determinant les Melanges de Deux Mots. 387-396
  
• Paul G. Spirakis, Athanasios K. Tsakalidis:
  A Very Fast, Practical Algorithm for Finding a Negative Cycle in a Digraph. 397-406
  
• Colin Stirling:
  A Compositional Reformulation of Owicki-Gries's Partial Correctness Logic for a Concurrent While Language. 407-415
  
• Howard Straubing:
  Semigroups and Languages of Dot-Depth 2. 416-423
  
• Peter J. Varman, Kshitij Doshi:
  A Parallel Vertex Insertion Algorithm For Minimum Spanning Trees. 424-433
  
• Klaus W. Wagner:
  More Complicated Questions About Maxima and Minima, and Some Closures of NP. 434-443
  
• Dan E. Willard:
  Lower Bounds for Dynamic Range Query Problems That Permit Subtraction (Extended Abstract). 444-453
  
• Jia-Huai You, P. A. Subrahmanyam:
  E-Unification Algorithms for a Class of Confluent Term Rewriting Systems. 454-463
  
• Damian Niwinski:
  On Fixed-Point Clones (Extended Abstract). 464-473