Skip to main content
SpringerLink
Log in

STACS 89

6th Annual Symposium on Theoretical Aspects of Computer Science, Paderborn, FRG, February 16-18, 1989; Proceedings

  • Conference proceedings
  • © 1989

Overview

Editors:
  1. B. Monien
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. R. Cori
    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 349)

Included in the following conference series:

Conference proceedings info: STACS 1989.

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 54.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 (51 papers)

  1. Complete problems and strong polynomial reducibilities

    • K. Ganesan, Steven Homer
    Pages 240-250

  2. If deterministic and nondeterministic space complexities are equal for log log n then they are also equal for log n

    • Andrzej Szepietowski
    Pages 251-255

  3. On the complexity of approximating the independent set problem

    • Piotr Berman, Georg Schnitger
    Pages 256-268

  4. Average number of messages for distributed leader finding in rings of processors

    • Christian Lavault
    Pages 269-281

  5. Time vs bits

    • Mark Overmars, Nicola Santoro
    Pages 282-293

  6. Distributed computing on transitive networks: The torus

    • Paul W. Beame, Hans L. Bodlaender
    Pages 294-303

  7. Time is not a healer

    • Nicola Santoro, Peter Widmayer
    Pages 304-313

  8. Area efficient methods to increase the reliability of combinatorial circuits

    • Rüdiger Reischuk, Bernd Schmeltz
    Pages 314-326

  9. Fault masking probabilities with single and multiple signature analysis

    • Jürgen Doenhardt
    Pages 327-338

  10. Chain properties of rule closures

    • Miki Hermann
    Pages 339-347

  11. It is undecidable whether the Knuth-Bendix completion procedure generates a crossed pair

    • Paliath Narendran, Jonathan Stillman
    Pages 348-359

  12. Algebraic specifications for domain theory

    • Friederike Nickl
    Pages 360-374

  13. The query topology in logic programming

    • Aida Batarekh, V. S. Subrahmanian
    Pages 375-387

  14. Testing membership: Beyond permutation groups

    • M. Beaudry, P. McKenzie, D. Thérien
    Pages 388-399

  15. Membership in polynomial ideals over Q is exponential space complete

    • Ernst Mayr
    Pages 400-406

  16. Some complexity theoretic aspects of AC rewriting

    • Rakesh M. Verma, I. V. Ramakrishnan
    Pages 407-420

  17. Deciding bisimulation equivalences for a class of non-finite-state programs

    • Bengt Jonsson, Joachim Parrow
    Pages 421-433

  18. Measure of parallelism of distributed computations

    • Bernadette Charron-Bost
    Pages 434-445

  19. Decidability of weak fairness in petri nets

    • Petr Jančar
    Pages 446-457

  20. New results on the generalized star-height problem

    • J. E. Pin, H. Straubing, D. Thérien
    Pages 458-467
Back to top

Other volumes

  1. STACS 89

Keywords

About this book

This volume contains the presentations of the Sixth Symposium on Theoretical Aspects of Computer Science (STACS 89) held at the University of Paderborn, February 16-18, 1989. In addition to papers presented in the regular program the volume contains abstracts of software systems demonstrations which were included in this conference series in order to show applications of research results in theoretical computer science. The papers are grouped into the following thematic sections: computational geometry, automata theory and formal languages, semantics of programming languages, parallel algorithms, graph algorithms, complexity, structures, fault tolerance, completeness, distributed computing and concurrency.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation