Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 1998

23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998

  • Conference proceedings
  • © 1998

Overview

Editors:
  1. Luboš Brim
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Jozef Gruska
    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jiří Zlatuš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 1450)

Included in the following conference series:

Conference proceedings info: MFCS 1998.

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

  1. Front Matter

    Download chapter PDF

  2. Hypergraph traversal revisited: Cost measures and dynamic algorithms

    • Giorgio Ausiello, Giuseppe F. Italiano, Umberto Nanni
    Pages 1-16

  3. Defining the Java Virtual Machine as platform for provably correct Java compilation

    • Egon Börger, Wolfram Schulte
    Pages 17-35

  4. Towards a theory of recursive structures

    • David Harel
    Pages 36-53

  5. Modularization and abstraction: The keys to practical formal verification

    • Yonit Kesten, Amir Pnueli
    Pages 54-71

  6. On the role of time and space in neural computation

    • Wolfgang Maass
    Pages 72-83

  7. From algorithms to working programs: On the use of program checking in LEDA

    • Kurt Mehlhorn, Stefan Näher
    Pages 84-93

  8. Computationally-sound checkers

    • Silvio Micali
    Pages 94-116

  9. Reasoning about the past

    • Mogens Nielsen
    Pages 117-128

  10. Satisfiability — Algorithms and logic

    • Pavel Pudlák
    Pages 129-141

  11. The joys of bisimulation

    • Colin Stirling
    Pages 142-151

  12. Towards algorithmic explanation of mind evolution and functioning

    • Jiří Wiedermann
    Pages 152-166

  13. Combinatorial hardness proofs for polynomial evaluation

    • Mikel Aldaz, Joos Heintz, Guillermo Matera, José L. Montaña, Luis M. Pardo
    Pages 167-175

  14. Minimum propositional proof length is NP-hard to linearly approximate

    • Michael Alekhnovich, Sam Buss, Shlomo Moran, Toniann Pitassi
    Pages 176-184

  15. Reconstructing polyatomic structures from discrete X-rays: NP-completeness proof for three atoms

    • Marek Chrobak, Christoph Dürr
    Pages 185-193

  16. Locally explicit construction of rődl's asymptotically good packings

    • Nikolai N. Kuzjurin
    Pages 194-202

  17. Proof theory of fuzzy logics: Urquhart's C and related logics

    • Matthias Baaz, Agata Ciabattoni, Christian Fermüller, Helmut Veith
    Pages 203-212

  18. Nonstochastic languages as projections of 2-tape quasideterministic languages

    • Richard Bonner, Rūsiņš Freivalds, Jānis Lapiņš, Antra Lukjanska
    Pages 213-219

  19. Flow logic for Imperative Objects

    • Flemming Nielson, Hanne Riis Nielson
    Pages 220-228

  20. Expressive completeness of Temporal Logic of action

    • Alexander Rabinovich
    Pages 229-238
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 1998

Keywords

About this book

This book constitutes the refereed proceedings of the 23rd International Symposium on the Mathematical Foundations of Computer Science, MFCS'98, held in Brno, Czech Republic, in August 1998.
The 71 revised full papers presented were carefully reviewed and selected from a total of 168 submissions. Also included are 11 full invited surveys by prominent leaders in the area. The papers are organized in topical sections on problem complexity; logic, semantics, and automata; rewriting; automata and transducers; typing; concurrency, semantics, and logic; circuit complexity; programming; structural complexity; formal languages; graphs; Turing complexity and logic; binary decision diagrams, etc..

Bibliographic Information

  • Book Title: Mathematical Foundations of Computer Science 1998

  • Book Subtitle: 23rd International Symposium, MFCS'98, Brno, Czech Republic, August 24-28, 1998

  • Editors: Luboš Brim, Jozef Gruska, Jiří Zlatuška

  • Series Title: Lecture Notes in Computer Science

  • DOI: https://doi.org/10.1007/BFb0055753

  • Publisher: Springer Berlin, Heidelberg

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag Berlin Heidelberg 1998

  • Softcover ISBN: 978-3-540-64827-7Published: 12 August 1998

  • eBook ISBN: 978-3-540-68532-6Published: 18 August 2006

  • Series ISSN: 0302-9743

  • Series E-ISSN: 1611-3349

  • Edition Number: 1

  • Number of Pages: XVIII, 854

  • Topics: Theory of Computation, Computer Communication Networks, Discrete Mathematics in Computer Science

Publish with us

Policies and ethics

Back to top

Search

Navigation