Skip to main content
SpringerLink
Log in
Book cover
  • Conference proceedings
  • © 1989

Mathematical Foundations of Computer Science 1989

Porabka-Kozubnik, Poland, August 28 - September 1, 1989. Proceedings

Editors:

  1. Antoni Kreczmar
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Grazyna Mirkowska
    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 379)

Sections

Buy it now

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

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

Table of contents (52 papers)

  1. System simulation and the sensitivity of self-stabilization

    • Mohamed G. Gouda, Rodney R. Howell, Louis E. Rosier
    Pages 249-258

  2. Polynomial-time functions generate SAT: On P-splinters

    • Lane A. Hemachandra, Albrecht Hoene, Dirk Siefkes
    Pages 259-269

  3. Generalized definite tree languages

    • Uschi Heuter
    Pages 270-280

  4. Pinwheel scheduling with two distinct numbers

    • Robert Holte, Louis Rosier, Igor Tulchinsky, Donald Varvel
    Pages 281-290

  5. Testing approximate symmetry in the plane is NP-hard

    • Sebastian Iwanowski
    Pages 291-304

  6. Memory and algebra

    • C. Jousselin, J -P. Moskowitz
    Pages 305-313

  7. Integer relations among algebraic numbers

    • Bettina Just
    Pages 314-320

  10. On the nature of TELLUS

    • V. Manca, A. Salibra, G. Scollo
    Pages 338-349

  11. Switching graphs and their complexity

    • Christoph Meinel
    Pages 350-359

  12. Pomset semantics for true concurrency with synchronization and recursion

    • J. -J. Ch. Meyer, E. P. de Vink
    Pages 360-369

  13. Oracle branching programs and Logspace versus P

    • David A. Mix Barrington, Pierre McKenzie
    Pages 370-379

  15. Area complexity of merging

    • Vladimír Palko, Ondrej Sýkora, Imrich VrÅ¥o
    Pages 390-396

  16. Logically defined subsets of IN k

    • Pierre Péladeau
    Pages 397-407

  19. Knuth-Morris-Pratt algorithm: An analysis

    • Mireille Regnier
    Pages 431-444
Back to top

About this book

The present volume contains papers selected for presentation at the 14th Symposium on Mathematical Foundations of Computer Science - MFCS '89 held in Porabka-Kozubnik, Poland, from August 28 to September 1, 1989. Previous MFCs proceedings have also been published in the Lecture Notes in Computer Science. This volume presents investigations and results in theoretical computer science, in particular in the following areas: logics of programs, parallel and distributed computing, deductive databases, automata and formal languages, algorithms and data structures, software specification and validity, complexity and computability theory.
Back to top

Keywords

Back to top

Bibliographic Information

Back to top

Publish with us

Policies and ethics

Back to top
Access via your institution

Buy it now

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

Search

Navigation