Skip to main content
  • Conference proceedings
  • © 1986

STACS 86

3rd Annual Symposium on Theoretical Aspects of Computer Science - Orsay, France, January 16-18, 1986

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 210)

Buying options

Softcover Book USD 49.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (30 papers)

  1. Front Matter

  2. Temporal reasoning under generalized fairness constraints

    • E. Allen Emerson, Chin-Laung Lei
    Pages 21-36
  3. Ions and local definitions in logic programming

    • M. A. Nait Abdallah
    Pages 60-72
  4. A parallel statistical cooling algorithm

    • E. H. L. Aarts, F. M. J. de Bont, J. H. A. Habers, P. J. M. van Laarhoven
    Pages 87-97
  5. Polynomial time algorithms for finding integer relations among real numbers

    • J. Hastad, B. Helfrich, J. Lagarias, C. P. Schnorr
    Pages 105-118
  6. New upperbounds for decentralized extrema-finding in a ring of processors

    • H. L. Bodlaender, J. van Leeuwen
    Pages 119-129
  7. Algorithms for visibility representations of planar graphs

    • Roberto Tamassia, Ioannis G. Tollis
    Pages 130-141
  8. Speeding up random access machines by few processors

    • Friedhelm Meyer auf der Heide
    Pages 142-152
  9. Varietes de Semis Groupes et Mots Infinis

    • Jean-Pierre Pécuchet
    Pages 180-191
  10. Equations in free partially commutative monoids

    • Christine Duboc
    Pages 192-202
  11. Separating and testing

    • Ph. Darondeau
    Pages 203-212
  12. Decomposition de Fonctions Rationnelles

    • C. Choffrut, M. P Schutzenberger
    Pages 213-226
  13. Long unavoidable patterns

    • Ursula Schmidt
    Pages 227-235

Keywords

  • Monoid
  • Notation
  • algorithms
  • automata
  • complexity
  • computer
  • logic
  • proof
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

Softcover Book USD 49.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions