default search action
3rd STACS 1986: Orsay, France
- Burkhard Monien, Guy Vidal-Naquet:
STACS 86, 3rd Annual Symposium on Theoretical Aspects of Computer Science, Orsay, France, January 16-18, 1986, Proceedings. Lecture Notes in Computer Science 210, Springer 1986, ISBN 3-540-16078-7
Contributed Papers
- Flemming Nielson:
Abstract Interpretation of Denotational Definions (A Survey). 1-20 - E. Allen Emerson, Chin-Laung Lei:
Temporal Reasoning Under Generalized Fairness Constraints. 21-36 - Didier Caucal:
Décidabiité de l'égalité des Languages Algébriques Infinitaires Simples. 37-48 - David de Frutos-Escrig
:
Some Probabilistic Powerdomains in the Category SFP. 49-59 - M. A. Nait Abdallah:
Icons and Local Definitions in Logic Programming. 60-72 - Paul G. Spirakis:
Input Sensitive, Optimal Parallel Randomized Algorithms for Addition and Identification. 73-86 - 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 - Andrzej Lingas:
Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time. 98-103 - Johan Håstad, Bettina Helfrich, J. C. Lagarias, Claus-Peter Schnorr:
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers. 105-118 - Hans L. Bodlaender
New Upperbounds for Decentralized Extrema-Finding in a Ring of Processors. 119-129 - Roberto Tamassia, Ioannis G. Tollis:
Algorithms for Visibility Representations of Planar Graphs. 130-141 - Friedhelm Meyer auf der Heide:
Speeding up Random Access Machines by Few Processors. 142-152 - Thomas Lengauer:
Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs. 153-170 - Oscar H. Ibarra, Bala Ravikumar:
On Sparseness, Ambiguity and other Decision Problems for Acceptors and Transducers. 171-179 - Jean-Pierre Pécuchet:
Variétés de Semis Groupes et Mots Infinis. 180-191 - Christine Duboc:
Equations in Free Partially Commutative Monoids. 192-202 - Philippe Darondeau:
Separating and Testing. 203-212 - Christian Choffrut, Marcel Paul Schützenberger:
Décomposition de Fonctions Rationnelles. 213-226 - Ursula Schmidt:
Long Unavoidable Patterns. 227-235 - Gilles Bernot, Michel Bidoit, Christine Choppy:
Abstract Implementations and Correctness Proofs. 236-251 - Udo Kelter:
Strictness and Serializability. 252-261 - B. Gamatie:
Towards Specification and Proof of Asynchronous Systems. 262-276 - 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 - Chandra M. R. Kintala, Detlef Wotschke:
Concurrent Conciseness of Degree, Probabilistic, Nondeterministic and Deterministic Finite Automata (Extended Abstract). 291-305 - Louis E. Rosier, Hsu-Chun Yen:
Logspace Hierarchies, Polynomial Time and the Complexity of Fairness Problems Concerning omega-Machines. 306-320 - Juris Hartmanis, Lane A. Hemachandra
On Sparse Oracles Separating Feasible Complexity Classes. 321-333 - José L. Balcázar, Ronald V. Book:
On Generalized Kolmogorov Complexity. 334-340 - Kurt Mehlhorn, Franco P. Preparata:
Area-time Optimal Division for T=Omega(log n)1+epsilon. 341-352 - Allan Borodin, Faith E. Fich, Friedhelm Meyer auf der Heide, Eli Upfal
A Time-Space Tradeoff for Element Distinctness. 353-358
Invited Lecture
- Rüdiger Reischuk:
Parallel Machines and their Communication Theoretical Limits. 359-368
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-23 19:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: