Skip to main content
SpringerLink
Log in

STACS 86

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

  • Conference proceedings
  • © 1986

Overview

Editors:
  1. B. Monien
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. G. Vidal-Naquet
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

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

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (30 papers)

  1. Abstract implementations and correctness proofs

    • Gilles Bernot, Michel Bidott, Christine Choppy
    Pages 236-251

  2. Strictness and serializability

    • Udo Kelter
    Pages 252-261

  3. Towards specification and proof of asynchronous systems

    • B. Gamatie
    Pages 262-276

  4. Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report)

    • H. B. Hunt III, R. E. Stearns
    Pages 277-290

  5. Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata

    • C. M. R. Kintala, Detlef Wotschke
    Pages 291-305

  6. Logspace hierarchies, polynomial time and the complexity of fairness problems concerning ω-machines

    • Louis E. Rosier, Hsu-Chun Yen
    Pages 306-320

  7. On sparse oracles separating feasible complexity classes

    • Juris Hartmanis, Lane Hemachandra
    Pages 321-333

  8. On generalized kolmogorov complexity

    • José L. Balcázar, Ronald V. Book
    Pages 334-340

  9. Area-time optimal division for T=Ω((logn)1+ε)

    • K. Mehlhorn, F. P. Preparata
    Pages 341-352

  10. A time-space tradeoff for element distinctness

    • A. Borodin, F. Fich, F. Meyer auf der Heide, E. Upfal, A. Wigderson
    Pages 353-358

  11. Parallel machines and their communication theoretical limits

    • K. Rüdiger Reischuk
    Pages 359-368
Back to top

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation