Skip to main content
SpringerLink
Log in

Mathematical Foundations of Computer Science 1997

22nd International Symposium, MFCS'97, Bratislava, Slovakia, August 25-29, 1997, Proceedings

  • Conference proceedings
  • © 1997

Overview

Editors:
  1. Igor Prívara
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Peter Ružič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 1295)

Included in the following conference series:

Conference proceedings info: MFCS 1997.

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 (51 papers)

  1. Front Matter

    Download chapter PDF

  2. Game semantics for programming languages

    • Samson Abramsky
    Pages 1-4

  3. Communication complexity

    • László Babai
    Pages 5-18

  4. Treewidth: Algorithmic techniques and results

    • Hans L. Bodlaender
    Pages 19-36

  5. When are two rewrite systems more than none?

    • Nachum Dershowitz
    Pages 37-43

  6. Positive applications of lattices to cryptography

    • Cynthia Dwork
    Pages 44-51

  7. A tile-based coordination view of asynchronous π-calculus

    • GianLuigi Ferrari, Ugo Montanari
    Pages 52-70

  8. Communication complexity and sequential computation

    • Juraj Hromkovič, Georg Schnitger
    Pages 71-84

  9. Lower bounds for a proof system with an exponential speed-up over constant-depth Frege systems and over polynomial calculus

    • Jan Krajiček
    Pages 85-90

  10. Computational limitations of Stochastic Turing machines and Arthur-Merlin games with small space bounds

    • Maciej Liśkiewicz, Rüdiger Reischuk
    Pages 91-107

  11. Learning to perform knowledge-intensive inferences

    • Dan Roth
    Pages 108-109

  12. Resolution proofs, exponential bounds, and Kolmogorov complexity

    • Uwe Schöning
    Pages 110-116

  13. The expressiveness of Datalog cicuits (DAC)

    • Foto Afrati, Irène Guessarian, Michel de Rougemont
    Pages 117-128

  14. The complexity of policy evaluation for finite-horizon partially-observable Markov decision processes

    • Martin Mundhenk, Judy Goldsmith, Eric Allender
    Pages 129-138

  15. A category of transition systems and its relations with orthomodular posets

    • Luca Bernardinello, Lucia Pomello
    Pages 139-148

  16. Accepting Zeno words without making time stand still

    • Béatrice Bérard, Claudine Picaronny
    Pages 149-158

  17. Complexity theoretical results on partitioned (nondeterministic) binary decision diagrams

    • Beate Bollig, Ingo Wegener
    Pages 159-168

  18. Specifying computations using hyper transition systems

    • Marcello M. Bonsangue, Joost N. Kok
    Pages 169-178

  19. A shift-invariant metric on S zz inducing a non-trivial topology

    • G. Cattaneo, E. Formenti, L. Margara, J. Mazoyer
    Pages 179-188

  20. Subtyping calculus of construction (extended abstract)

    • Gang Chen
    Pages 189-198
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1997

Keywords

About this book

This book constitutes the refereed proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS '97, held in Bratislava, Slovakia, in August 1997.
The 40 revised full papers presented were carefully selected from a total of 94 submissions. Also included are nine invited papers and two abstracts of invited talks. The papers cover the whole range of theoretical computer science including programming theory, complexity theory, mathematical logic, rewriting, grammars, formal languages, theory of algorithms, computational graph theory, etc.

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation