Advertisement

Table of contents

  1. Front Matter
  2. Eric Allender, Vivek Gore
    Pages 1-15
  3. Johannes Buchmann
    Pages 16-21
  4. Jin-yi Cai
    Pages 22-32
  5. Christel Baier, Mila E. Majster-Cederbaum
    Pages 105-120
  6. Bernd Bank, Teresa Krick, Reinhard Mandel, Pablo Solernó
    Pages 121-125
  7. E. Barcucci, R. Pinzani, E. Rodella, R. Sprugnoli
    Pages 126-135
  8. Luca Breveglieri, Claudio Citrini, Stefano Crespi-Reghizzi
    Pages 146-156
  9. Danilo Bruschi, Giovanni Pighizzini
    Pages 157-167
  10. Gerhard Buntrock, Birgit Jenner, Klaus-Jörn Lange, Peter Rossmanith
    Pages 168-179
  11. Marc Chardin
    Pages 180-189
  12. Bogdan S. Chlebus, Imrich Vrťo
    Pages 190-199
  13. E. Fachini, A. Monti, M. Napoli, D. Parente
    Pages 210-219
  14. Thomas Hofmeister, Walter Hohberg, Susanne Köhling
    Pages 230-239
  15. Oscar H. Ibarra, Nicholas Q. Trân
    Pages 248-257
  16. Stasys Jukna
    Pages 265-274
  17. Emmanuel Kounalis, Michaël Rusinowitch
    Pages 307-317
  18. Dieter Kratsch, Lane A. Hemachandra
    Pages 318-328
  19. Christos Levcopoulos, Ola Petersson
    Pages 329-338
  20. Guy Louchard, Claire Kenyon, René Schott
    Pages 339-349
  21. Wojciech Plandowski, Wojciech Rytter, Tomasz Szymacha
    Pages 370-379
  22. Kai Salomaa, Sheng Yu
    Pages 380-389
  23. Heiko Schröder, Ondrej Sýkora, Imrich Vrťo
    Pages 390-394
  24. R. S. Valiveti, B. J. Oommen, J. R. Zgierski
    Pages 405-414

About these proceedings

Introduction

This volume contains papers which were contributed for presentation at the international conference "Fundamentals of Computation Theory - FCT '91" heldat Gosen, near Berlin, September 9-13, 1991. This was the eighth in the series of FCT conferences organized every odd year. The programme of theconference, including invited lectures and selected contributions, falls into the following categories: - Semantics and logical concepts in the theory of computing, formal specification, - Automata and formal languages, Computational geometry, - Algorithmic aspects of algebra and algebraic geometry, cryptography, - Complexity (sequential, parallel, distributed computing, structure, lower bounds, complexity of analytical problems, general concepts), - Algorithms (efficient, probabilistic, parallel, sequential, distributed), - Counting and combinatorics in connection with mathematical computer science. The proceedings of previous FCT meetings are available as Lecture Notes in Computer Science (Vols. 380, 278, 199, 158, 117, 56).

Keywords

Boolean function Combinatorics algorithm algorithms automata complexity computational geometry cryptography cryptology data structure distributed computing formal language formal specification programming semantics

Bibliographic information

  • DOI https://doi.org/10.1007/3-540-54458-5
  • Copyright Information Springer-Verlag Berlin Heidelberg 1991
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-54458-6
  • Online ISBN 978-3-540-38391-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site