Advertisement

Table of contents

  1. Front Matter
  2. Giorgio Gambosi, Giuseppe F. Italiano, Maurizio Talamo
    Pages 8-17
  3. Bernd Becker, Reiner Kolla
    Pages 18-28
  4. Bettina Just, Fb Mathematik, Friedhelm Meyer auf der Heide, Fb Informatik, Avi Wigderson
    Pages 29-37
  5. Mark H. Overmars, Michiel H. M. Smid
    Pages 38-51
  6. David Fernández-Baca, Giora Slutzki
    Pages 52-60
  7. Walter Unger
    Pages 61-72
  8. François Bergeron, Gilbert Labelle, Pierre Leroux
    Pages 73-80
  9. Volker Diekert, Axel Möbus
    Pages 126-135
  10. Clelia De Felice
    Pages 159-169
  11. Jean-Paul Allouche, Bernard Rande, Loÿs Thimonier
    Pages 170-183
  12. Wadoud Bousdira, Jean-Luc Rémy
    Pages 193-206
  13. Egidio Astesiano, Alessandro Giovini, Gianna Reggio
    Pages 207-226
  14. Franz J. Brandenburg
    Pages 227-236
  15. Martín Abadi, Joan Feigenbaum
    Pages 264-272
  16. Guan-Ing Chen, Ten-Hwang Lai
    Pages 273-280
  17. Rolf Klein, Derick Wood
    Pages 281-291
  18. N. Santoro, J. B. Sidney, S. J. Sidney, J. Urrutia
    Pages 292-300
  19. Jörg-R. Sack, Subhash Suri
    Pages 312-321
  20. Francis Avnaim, Jean Daniel Boissonnat
    Pages 322-333
  21. Edward Ochmanski
    Pages 346-355
  22. Irène Guessarian, Wafaa Niar-Dinedane
    Pages 356-372
  23. Patrick Bellot, Remi Legrand
    Pages 389-390
  24. Marc V. Benveniste
    Pages 391-392
  25. F. Bergeron, G. Cartier
    Pages 393-394
  26. Thierry Boy de la Tour, Ricardo Caferra, Gilles Chaminade
    Pages 395-396
  27. Dewez Louis, Douin Jean-michel, Lucas Philippe
    Pages 397-398

About these proceedings

Introduction

This volume contains the presentations of the Fifth Symposium on Theoretical Aspects of Computer Science (STACS 88) held at the University of Bordeaux, February 11-13, 1988. 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: algorithms, complexity, formal languages, rewriting systems and abstract data types, graph grammars, distributed algorithms, geometrical algorithms, trace languages, semantics of parallelism.

Keywords

Algorithms Automat Bisimulation Boolean algebra Modula Monoid Scheduling automata complexity computer computer algebra data structure formal language programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0035825
  • Copyright Information Springer-Verlag Berlin Heidelberg 1988
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-18834-6
  • Online ISBN 978-3-540-48190-4
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Finance, Business & Banking
Electronics
IT & Software
Telecommunications