Skip to main content
  • Conference proceedings
  • © 1990

Mathematical Foundations of Computer Science 1990

Banska Bystrica, Czechoslovakia, August 27-31, 1990 Proceedings

Editors:

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 452)

Conference series link(s): MFCS: International Symposium on Mathematical Foundations of Computer Science

Conference proceedings info: MFCS 1990.

Buying options

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47185-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)

This is a preview of subscription content, access via your institution.

Table of contents (62 papers)

  1. Front Matter

  2. Syntactic theories

    • Jean-Pierre Jouannaud
    Pages 15-25
  3. On kleene algebras and closed semirings

    • Dexter Kozen
    Pages 26-47
  4. Interactive computations of optimal solutions

    • Jan Krajíček, Pavel Pudlák, Jiří Sgall
    Pages 48-60
  5. Dynamic hashing strategies

    • Friedhelm Meyer auf der Heide
    Pages 76-87
  6. One-way functions in complexity theory

    • Alan L. Selman
    Pages 88-104
  7. Type inference problems: A survey

    • Jerzy Tiuryn
    Pages 105-120
  8. Counting the number of solutions

    • Jacobo Torán
    Pages 121-134
  9. On the power of uniform families of constant depth threshold circuits

    • Eric Allender, Ulrich Hertrampf
    Pages 158-164
  10. Separating sets of hyperrectangles

    • Fabrizio d'Amore, Paolo Giulio Franciosa
    Pages 165-172
  11. On preemptive scheduling of periodic, real-time tasks on one processor

    • Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
    Pages 173-179
  12. Retractions in comparing prolog semantics (extended abstract)

    • A. de Bruin, E. P. de VINK
    Pages 180-186
  13. Using inductive counting to simulate nondeterministic computation

    • Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
    Pages 187-194
  14. On fast algorithms for two servers

    • Marek Chrobak, Lawrence L. Larmore
    Pages 202-208
  15. Decomposition of semi commutations

    • M. Clerbout, D. Gonzalez
    Pages 209-216

Other Volumes

  1. Mathematical Foundations of Computer Science 1990

    Banská Bystrica, Czechoslovakia August 27–31, 1990 Proceedings

About this book

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
  • algorithm analysis and problem complexity

Bibliographic Information

Buying options

eBook USD 99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-47185-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book USD 129.00
Price excludes VAT (USA)