Skip to main content
  • Conference proceedings
  • © 1994

Mathematical Foundations of Computer Science 1994

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

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

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

Conference proceedings info: MFCS 1994.

Buy it now

Buying options

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

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

Table of contents (54 papers)

  1. Front Matter

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

    • Pavol Ďuriš, José D. P. Rolim
    Pages 38-51
  3. Solving polynomial fixed point equations

    • Stephen L. Bloom, Zoltán Ésik
    Pages 52-67
  4. Communication throughput of interconnection networks

    • Burkhard Monien, Ralf Diekmann, Reinhard Lüling
    Pages 72-86
  5. Intuitive counterexamples for constructive fallacies

    • James Lipton, Michael J. O'Donnell
    Pages 87-111
  6. Algebraic methods in the compositional analysis of logic programs

    • Fernando Orejas, Elvira Pino, Hartmut Ehrig
    Pages 112-126
  7. Longest common subsequences

    • Mike Paterson, Vlado Dančík
    Pages 127-142
  8. Towards DNA sequencing chips

    • Pavel A. Pevzner, Robert J. Lipshutz
    Pages 143-158
  9. On-line scheduling of parallel jobs

    • Jiří Sgall
    Pages 159-176
  10. Stable bistructure models of PCF

    • Glynn Winskel
    Pages 177-197
  11. May and must convergency in concurrent λ-calculus

    • F. Alessi, M. Dezani-Ciancaglini, U. de'Liguoro
    Pages 211-220
  12. Genericity and measure for exponential time

    • Klaus Ambos-Spies, Hans-Christian Neis, Sebastiaan A. Terwijn
    Pages 221-232
  13. Analysis of bounded disorder

    • Ricardo A. Baeza-Yates
    Pages 233-244
  14. On languages accepted with simultaneous complexity bounds and their ranking problem

    • Alberto Bertoni, Carlo Mereghetti, Giovanni Pighizzini
    Pages 245-255
  15. Embedding complete binary trees into star networks

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

Other Volumes

  1. Mathematical Foundations of Computer Science 1994

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

Buy it now

Buying options

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