Skip to main content
SpringerLink
Log in

STACS 87

4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987

  • Conference proceedings
  • © 1987

Overview

Editors:
  1. Franz J. Brandenburg
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Guy Vidal-Naquet
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Martin Wirsing
    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 247)

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 69.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 (47 papers)

  1. Front Matter

    Download chapter PDF

  2. Towards a theory of relativizations: Positive relativizations

    • Ronald V. Book
    Pages 1-21

  3. Natural semantics

    • G. Kahn
    Pages 22-39

  4. On local routing of two-terminal nets

    • Michael Kaufmann, Kurt Mehlhorn
    Pages 40-52

  5. Geometric relations among Voronoi diagrams

    • Franz Aurenhammer, Hiroshi Imai
    Pages 53-65

  6. Finding the largest empty rectangle on a grated surface

    • J. Dean Brock
    Pages 66-75

  7. Efficient graph algorithms using limited communication on a fixed-size array of processors

    • Kshitij Doshi, Peter Varman
    Pages 76-87

  8. On selecting the largest element in spite of erroneous information

    • B. Ravikumar, K. Ganesan, K. B. Lakshmanan
    Pages 88-99

  9. The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems

    • T. Lengauer, K. W. Wagner
    Pages 100-113

  10. Graph isomorphism is in the low hierarchy

    • Uwe Schöning
    Pages 114-124

  11. A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees

    • John G. Geske, Dung T. Huynh, Alan L. Selman
    Pages 125-135

  12. Self-reducibility

    • José L. Balcázar
    Pages 136-147

  13. Probability one separation of the Boolean hierarchy

    • Jin-yi Cai
    Pages 148-158

  14. Reversal complexity of multicounter and multihead machines

    • Juraj Hromkovič
    Pages 159-168

  15. Computing the counting function of context-free languages

    • A. Bertoni, M. Goldwurm, N. Sabadini
    Pages 169-179

  16. On the k-freeness of morphisms on free monoids

    • Veikko Keränen
    Pages 180-188

  17. Avoidable patterns on 2 letters

    • Ursula Schmidt
    Pages 189-197

  18. Polynomial operations on rational languages

    • Mustapha Arfi
    Pages 198-206

  19. Some structural aspects of hypergraph languages generated by hyperedge replacement

    • Annegret Habel, Hans-Jörg Kreowski
    Pages 207-219

  20. Specification and implementation of concurrently accessed data structures: An abstract data type approach

    • Stéphane Kaplan, Amir Pnueli
    Pages 220-244
Back to top

Keywords

Bibliographic Information

  • Book Title: STACS 87

  • Book Subtitle: 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987

  • Editors: Franz J. Brandenburg, Guy Vidal-Naquet, Martin Wirsing

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0039590

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1987

  • Softcover ISBN: 978-3-540-17219-2Published: 11 February 1987

  • eBook ISBN: 978-3-540-47419-7Published: 11 April 2006

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XII, 483

  • Topics: Theory of Computation, Computation by Abstract Devices, Algorithm Analysis and Problem Complexity

Publish with us

Policies and ethics

Back to top

Search

Navigation