Skip to main content
SpringerLink
Log in

STACS 91

8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings

  • Conference proceedings
  • © 1991

Overview

Editors:
  1. Christian Choffrut
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Matthias Jantzen
    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 480)

Included in the following conference series:

Conference proceedings info: STACS 1991.

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 109.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. Front Matter

    Download chapter PDF

  2. Polymorphism, parameterization and typing: An algebraic specification perspective

    • Jacek Leszczylowski, Martin Wirsing
    Pages 1-15

  3. Executable higher-order algebraic specifications

    • Jean-Pierre Jouannaud
    Pages 16-25

  4. Efficient memory access in large-scale computation

    • Jeffrey Scott Vitter
    Pages 26-41

  5. l-occurrences of avoidable patterns

    • Peter Roth
    Pages 42-49

  6. Rational relations with bounded delay

    • Christiane Frougny, Jacques Sakarovitch
    Pages 50-63

  7. On the power of several queues

    • Martin Schmidt
    Pages 64-75

  8. On aperiodic trace languages

    • G. Guaiana, A. Restivo, S. Salemi
    Pages 76-88

  9. Recognizable and rational languages of finite and infinite traces

    • Paul Gastin
    Pages 89-104

  10. On the concatenation of infinite traces

    • Volker Diekert
    Pages 105-117

  11. Tight RNC approximations to Max Flow

    • Maria Serna, Paul Spirakis
    Pages 118-126

  12. A natural metric for curves — Computing the distance for polygonal chains and approximation algorithms

    • Michael Godau
    Pages 127-136

  13. The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n

    • Ingo Wegener
    Pages 137-147

  14. Decision problems for term rewriting systems and recognizable tree languages

    • Rémi Gilleron
    Pages 148-159

  15. Decidable sentences for context-free groups

    • K. Madlener, F. Otto
    Pages 160-171

  16. The owner concept for PRAMs

    • Peter Rossmanith
    Pages 172-183

  17. Actors as a parallel programming model

    • Françoise Baude, Guy Vidal-Naquet
    Pages 184-195

  18. Average case analysis of unification algorithms

    • Luc Albert, Rafael Casas, François Fages, A. Torrecillas, Paul Zimmermann
    Pages 196-213

  19. Methodology for proving the termination of logic programs

    • Bal Wang, R. K. Shyamasundar
    Pages 214-227

  20. Polynomial size constant depth circuits with a limited number of negations

    • Miklos Santha, Christopher Wilson
    Pages 228-237
Back to top

Other volumes

  1. STACS 91

Keywords

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation