Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1990

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

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Branislav Rovan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

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

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (62 papers)

  1. Front Matter

    Download chapter PDF

  2. A logical operational semantics of full Prolog

    • Egon Börger
    Pages 1-14

  3. Syntactic theories

    • Jean-Pierre Jouannaud
    Pages 15-25

  4. On kleene algebras and closed semirings

    • Dexter Kozen
    Pages 26-47

  5. Interactive computations of optimal solutions

    • Jan Krajíček, Pavel Pudlák, Jiří Sgall
    Pages 48-60

  6. Restricted branching programs and their computational power

    • Christoph Meinel
    Pages 61-75

  7. Dynamic hashing strategies

    • Friedhelm Meyer auf der Heide
    Pages 76-87

  8. One-way functions in complexity theory

    • Alan L. Selman
    Pages 88-104

  9. Type inference problems: A survey

    • Jerzy Tiuryn
    Pages 105-120

  10. Counting the number of solutions

    • Jacobo Torán
    Pages 121-134

  11. Implementation of parallel graph reduction by explicit annotation and program transformation

    • Willem G. Vree
    Pages 135-151

  12. Interrogative complexity of ω-languages’ recognition

    • Māris Alberts
    Pages 152-157

  13. On the power of uniform families of constant depth threshold circuits

    • Eric Allender, Ulrich Hertrampf
    Pages 158-164

  14. Separating sets of hyperrectangles

    • Fabrizio d'Amore, Paolo Giulio Franciosa
    Pages 165-172

  15. On preemptive scheduling of periodic, real-time tasks on one processor

    • Sanjoy K. Baruah, Rodney R. Howell, Louis E. Rosier
    Pages 173-179

  16. Retractions in comparing prolog semantics (extended abstract)

    • A. de Bruin, E. P. de VINK
    Pages 180-186

  17. Using inductive counting to simulate nondeterministic computation

    • Gerhard Buntrock, Lane A. Hemachandra, Dirk Siefkes
    Pages 187-194

  18. Some properties of zerotesting bounded one-way multicounter machines

    • Ivana ČernĀ
    Pages 195-201

  19. On fast algorithms for two servers

    • Marek Chrobak, Lawrence L. Larmore
    Pages 202-208

  20. Decomposition of semi commutations

    • M. Clerbout, D. Gonzalez
    Pages 209-216
Back to top

Keywords

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.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation