Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 1994

19th International Symposium, MFCS'94, Kosice, Slovakia, August 22 - 26, 1994. Proceedings

  • Conference proceedings
  • © 1994

Overview

Editors:
  1. Igor Prívara
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Branislav Rovan
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Peter Ruzička
    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 841)

Included in the following conference series:

Conference proceedings info: MFCS 1994.

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 109.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 (54 papers)

  1. Front Matter

    Download chapter PDF

  2. Models, languages, and compiler technology for high performance computers

    • Thomas Cheatham
    Pages 1-26

  3. On NC-real complexity classes for additive circuits and their relations with NC

    • Michel Cosnard, Martin Matamala
    Pages 27-37

  4. E-complete sets do not have optimal polynomial time approximations

    • Pavol Ďuriš, José D. P. Rolim
    Pages 38-51

  5. Solving polynomial fixed point equations

    • Stephen L. Bloom, Zoltán Ésik
    Pages 52-67

  6. Capturing complexity classes with Lindström quantifiers

    • J. A. Makowsky
    Pages 68-71

  7. Communication throughput of interconnection networks

    • Burkhard Monien, Ralf Diekmann, Reinhard Lüling
    Pages 72-86

  8. Intuitive counterexamples for constructive fallacies

    • James Lipton, Michael J. O'Donnell
    Pages 87-111

  9. Algebraic methods in the compositional analysis of logic programs

    • Fernando Orejas, Elvira Pino, Hartmut Ehrig
    Pages 112-126

  10. Longest common subsequences

    • Mike Paterson, Vlado Dančík
    Pages 127-142

  11. Towards DNA sequencing chips

    • Pavel A. Pevzner, Robert J. Lipshutz
    Pages 143-158

  12. On-line scheduling of parallel jobs

    • Jiří Sgall
    Pages 159-176

  13. Stable bistructure models of PCF

    • Glynn Winskel
    Pages 177-197

  14. A Competitive analysis of the list update problem with lookahead

    • Susanne Albers
    Pages 199-210

  15. May and must convergency in concurrent λ-calculus

    • F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro
    Pages 211-220

  16. Genericity and measure for exponential time

    • Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn
    Pages 221-232

  17. Analysis of bounded disorder

    • Ricardo A. Baeza-Yates
    Pages 233-244

  18. On languages accepted with simultaneous complexity bounds and their ranking problem

    • Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
    Pages 245-255

  19. A proof system for asynchronously communicating deterministic processes

    • F. S. de Boer, M. van Hulst
    Pages 256-265

  20. Embedding complete binary trees into star networks

    • A. Bouabdallah, M. C. Heydemann, J. Opatrny, D. Sotteau
    Pages 266-275
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1994

Keywords

About this book

This volume constitutes the proceedings of the 19th International Symposium on Mathematical Foundations of Theoretical Computer Science, MFCS '94, held in Kosice, Slovakia in August 1994.
MFCS '94 brought together specialists in theoretical fields of computer science from various countries in order to stimulate mathematical research in theoretical computer science. Besides 12 papers based on invited talks by renowned experts, the book contains 42 research contributions selected from a total of 112 submissions. All areas of theoretical computer science are presented, some from a particular mathematical point of view.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation