Advertisement

Table of contents

About these proceedings

Introduction

This volume contains papers selected for presentation at the 15th Symposium on Mathematical Foundations of Computer Science, MFCS '90, held at Banská Bystrica, Czechoslovakia, August 27-31, 1990. Previous MFCS proceedings have also been published in the Lecture Notes in Computer Science. This symposium is the 15th in a series of international meetings which have taken place in Czechoslovakia and Poland. The aim of these symposia is to bring together specialists in theoretical fields of computer science from various countries and to stimulate mathematical research in theoretical computer science. These proceedings consist of 10 invited papers and 52 communications selected by the international Program Committee. The papers present the latest results in key areas of computer science by authors from Europe, USA, Japan and China.

Keywords

Algorithmen Algorithms Automata Theory Automatentheorie Computational Complexity Distributed Computing Graph Hashing Information Komplexität Resolution Verteiltes Rechnen complexity complexity theory sets

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0029591
  • Copyright Information Springer-Verlag Berlin Heidelberg 1990
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-52953-8
  • Online ISBN 978-3-540-47185-1
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Electronics
IT & Software
Telecommunications
Law
Aerospace
Engineering