Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1989

STACS 89

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

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)

Conference series link(s): STACS: Annual Symposium on Theoretical Aspects of Computer Science

Conference proceedings info: STACS 1989.

Sections

Buy it now

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

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

Table of contents (51 papers)

  1. Front Matter

    PDF

  2. On genuinely time bounded computations

    • Friedhelm Meyer auf der Heide
    Pages 1-16

  3. Unified Algebras and action semantics

    • Peter D. Mosses
    Pages 17-35

  5. A first order logic for partial functions

    • Francisca Lucio-Carrasco, Antonio Gavilanes-Franco
    Pages 47-58

  6. Observational implementations

    • Rolf Hennicker
    Pages 59-71

  7. On the boundary of a union of Rays

    • Panagiotis Alevizos, Jean-Daniel Boissonnat, Franco P. Preparata
    Pages 72-83

  8. Dynamic planar point location with optimal query time

    • Franco P. Preparata, Roberto Tamassia
    Pages 84-95

  9. An O(n log n) algorithm for computing a link center in a simple polygon

    • Hristo N. Djidjev, Andrzej Lingas, Jörg-Rüdiger Sack
    Pages 96-107

  10. Polynomial graph-colorings

    • Wolfgang Gutjahr, Emo Welzl, Gerhart Woeginger
    Pages 108-119

  11. Time-optimal simulations of networks by universal parallel computers

    • Friedhelm Meyer auf der Heide, Rolf Wanka
    Pages 120-131

  14. A generalization of automatic sequences

    • Jeffrey Shallit
    Pages 156-167

  17. Parallel computation of discrete Voronoi diagrams

    • Otfried Schwarzkopf
    Pages 193-204

  18. Successive approximation in parallel graph algorithms

    • Donald Fussell, Ramakrishna Thurimella
    Pages 205-217

  19. Reversals and alternation

    • Gerhard Buntrock, Albrecht Hoene
    Pages 218-228

  20. On the power of parity polynomial time

    • Jin-yi Cai, Lane A. Hemachandra
    Pages 229-239
Back to top

Other Volumes

  1. STACS 89

Back to top

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.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation