3. STACS 1986: Orsay, France

@proceedings{DBLP:conf/stacs/1986,
  editor    = {Burkhard Monien and
               Guy Vidal-Naquet},
  title     = {STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer
               Science, Orsay, France, January 16-18, 1986, Proceedings},
  booktitle = {STACS},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {210},
  year      = {1986},
  isbn      = {3-540-16078-7},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Contributed Papers

• Flemming Nielson: Abstract Interpretation of Denotational Definions (A Survey). 1-20 BibTeX
• E. Allen Emerson, Chin-Laung Lei: Temporal Reasoning Under Generalized Fairness Constraints. 21-36 BibTeX
• Didier Caucal: Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. 37-48 BibTeX
• David de Frutos-Escrig: Some Probabilistic Powerdomains in the Category SFP. 49-59 BibTeX
• M. A. Nait Abdallah: Icons and Local Definitions in Logic Programming. 60-72 BibTeX
• Paul G. Spirakis: Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. 73-86 BibTeX
• Emile H. L. Aarts, F. M. J. de Bont, J. H. A. Habers, Peter J. M. van Laarhoven: A Parallel Statistical Cooling Algorithm. 87-97 BibTeX
• Andrzej Lingas: Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. 98-103 BibTeX
• Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr: Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. 105-118 BibTeX
• Hans L. Bodlaender, Jan van Leeuwen: New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. 119-129 BibTeX
• Roberto Tamassia, Ioannis G. Tollis: Algorithms for Visibility Representations of Planar Graphs. 130-141 BibTeX
• Friedhelm Meyer auf der Heide: Speeding up Random Access Machines by Few Processors. 142-152 BibTeX
• Thomas Lengauer: Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. 153-170 BibTeX
• Oscar H. Ibarra, Bala Ravikumar: On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. 171-179 BibTeX
• Jean-Pierre Pécuchet: Variétés de Semis Groupes et Mots Infinis. 180-191 BibTeX
• Christine Duboc: Equations in Free Partially Commutative Monoids. 192-202 BibTeX
• Philippe Darondeau: Separating and Testing. 203-212 BibTeX
• Christian Choffrut, Marcel Paul Schützenberger: Décomposition de Fonctions Rationnelles. 213-226 BibTeX
• Ursula Schmidt: Long Unavoidable Patterns. 227-235 BibTeX
• Gilles Bernot, Michel Bidoit, Christine Choppy: Abstract Implementations and Correctness Proofs. 236-251 BibTeX
• Udo Kelter: Strictness and Serializability. 252-261 BibTeX
• B. Gamatie: Towards Specification and Proof of Asynchronous Systems. 262-276 BibTeX
• Harry B. Hunt III, Richard Edwin Stearns: Monotone Boolean Formulas, Distributive Lattices, and the Complexities of Logics, Algebraic Structures, and Computation Structures (Preliminary Report). 277-290 BibTeX
• Chandra M. R. Kintala, Detlef Wotschke: Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). 291-305 BibTeX
• Louis E. Rosier, Hsu-Chun Yen: Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. 306-320 BibTeX
• Juris Hartmanis, Lane A. Hemachandra: On Sparse Oracles Separating Feasible Complexity Classes. 321-333 BibTeX
• José L. Balcázar, Ronald V. Book: On Generalized Kolmogorov Complexity. 334-340 BibTeX
• Kurt Mehlhorn, Franco P. Preparata: Area-time Optimal Division for T=Omega(log n)^1+epsilon. 341-352 BibTeX
• Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal, Avi Wigderson: A Time-Space Tradeoff for Element Distinctness. 353-358 BibTeX

Invited Lecture

• Rüdiger Reischuk: Parallel Machines and their Communication Theoretical Limits. 359-368 BibTeX