Skip to main content
SpringerLink
Log in

STACS 90

7th Annual Symposium on Theoretical Aspects of Computer Science. Rouen, France, February 22-24, 1990. Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Christian Choffrut
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Thomas Lengauer
    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 415)

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 (26 papers)

  1. Front Matter

    Download chapter PDF

  2. A note on the almost-everywhere hierarchy for nondeterministic time

    • Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    Pages 1-11

  3. The ring of k-regular sequences

    • Jean-Paul Allouche, Jeffrey Shallit
    Pages 12-23

  4. Minimal pairs and complete problems

    • Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Pages 24-36

  5. Hiding instances in multioracle queries

    • Donald Beaver, Joan Feigenbaum
    Pages 37-48

  6. Counting classes: Thresholds, parity, mods, and fewness

    • Richard Beigel, John Gill, Ulrich Hertramp
    Pages 49-57

  7. Playing games of incomplete information

    • Jin-yi Cai, Anne Condon, Richard J. Lipton
    Pages 58-69

  8. Caterpillars and context-free languages

    • Michal P. Chytil, Burkhard Monien
    Pages 70-81

  9. Semi-commutations and algebraic languages

    • Mireille Clerbout, Yves Roos
    Pages 82-94

  10. Towards a process semantics in the logic programming style

    • Andrea Corradini, Ugo Montanari
    Pages 95-108

  11. Parallel computations on strings and arrays

    • Maxime Crochemore, Wojciech Rytter
    Pages 109-125

  12. Minimum vertex hulls for polyhedral domains

    • Gautam Das, Deborah Joseph
    Pages 126-137

  13. Combinatorial rewriting on traces

    • Volker Diekert
    Pages 138-151

  14. Kolmogorov complexity, restricted nondeterminism and generalized spectra

    • Deborah Joseph, Meera Sitharam
    Pages 152-164

  15. Relation-sorted algebraic specifications with built-in coercers: Basic notions and results

    • Hans-Jörg Kreowski, Zhenyu Qian
    Pages 165-175

  16. Computational power of one-way multihead finite automata

    • Mirosław Kutyłowski
    Pages 176-187

  17. Updating almost complete trees or one level makes all the difference

    • Tony W. Lai, Derick Wood
    Pages 188-194

  18. Sorting the sums (xi+yj) in O(n2) comparisons

    • Jean-Luc Lambert
    Pages 195-206

  19. Efficient checking of computations

    • Richard J. Lipton
    Pages 207-215

  20. Hard promise problems and nonuniform complexity

    • Luc Longpré, Alan L. Selman
    Pages 216-226
Back to top

Keywords

About this book

The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Française de Cybernétique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation