Table of contents

  1. Front Matter
  2. Eric Allender, Richard Beigel, Ulrich Hertrampf, Steven Homer
    Pages 1-11
  3. Jean-Paul Allouche, Jeffrey Shallit
    Pages 12-23
  4. Klaus Ambos-Spies, Steven Homer, Robert I. Soare
    Pages 24-36
  5. Donald Beaver, Joan Feigenbaum
    Pages 37-48
  6. Richard Beigel, John Gill, Ulrich Hertramp
    Pages 49-57
  7. Jin-yi Cai, Anne Condon, Richard J. Lipton
    Pages 58-69
  8. Michal P. Chytil, Burkhard Monien
    Pages 70-81
  9. Mireille Clerbout, Yves Roos
    Pages 82-94
  10. Andrea Corradini, Ugo Montanari
    Pages 95-108
  11. Maxime Crochemore, Wojciech Rytter
    Pages 109-125
  12. Gautam Das, Deborah Joseph
    Pages 126-137
  13. Volker Diekert
    Pages 138-151
  14. Mirosław Kutyłowski
    Pages 176-187
  15. Jean-Luc Lambert
    Pages 195-206
  16. Richard J. Lipton
    Pages 207-215
  17. Luc Longpré, Alan L. Selman
    Pages 216-226

About these proceedings

Introduction

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.

Keywords

Computer Formale Sprache Geometrische Algorithmen Graphentheoretische Algorithmen Komplexität algorithm algorithms automata complexity computer science logic optimization programming semantics theoretical computer science

Bibliographic information

  • Copyright Information Springer-Verlag 1990
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52282-9
  • Online ISBN 978-3-540-46945-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349