Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 2011

36th International Symposium, MFCS 2011, Warsaw, Poland, August 22-26, 2011, Proceedings

  • Conference proceedings
  • © 2011

Overview

Editors:
  1. Filip Murlak

    1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Piotr Sankowski

    1. Institute of Informatics, University of Warsaw, Warsaw, Poland

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  • State-of-the-art research
  • Fast-track conference proceedings
  • Unique visibility

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

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Included in the following conference series:

Conference proceedings info: MFCS 2011.

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
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 (54 papers)

  1. Contributed Papers

    1. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete

      • Stanislav Böhm, Stefan Göller
      Pages 194-205

    2. Energy and Mean-Payoff Parity Markov Decision Processes

      • Krishnendu Chatterjee, Laurent Doyen
      Pages 206-218

    3. The Role of Polymorphism in the Characterisation of Complexity by Soft Types

      • Jacek Chrząszcz, Aleksy Schubert
      Pages 219-230

    4. An Algebraic Theory of Complexity for Valued Constraints: Establishing a Galois Connection

      • David A. Cohen, Páidí Creed, Peter G. Jeavons, Stanislav Živný
      Pages 231-242

    5. On the Use of Guards for Logics with Data

      • Thomas Colcombet, Clemens Ley, Gabriele Puppis
      Pages 243-255

    6. An Elementary Proof of a 3n − o(n) Lower Bound on the Circuit Complexity of Affine Dispersers

      • Evgeny Demenkov, Alexander S. Kulikov
      Pages 256-265

    7. On the Complexity of the l-diversity Problem

      • Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
      Pages 266-277

    8. Infinite Synchronizing Words for Probabilistic Automata

      • Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
      Pages 278-289

    9. Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs

      • Balder ten Cate, Alessandro Facchini
      Pages 290-302

    10. Parity Games on Graphs with Medium Tree-Width

      • John Fearnley, Oded Lachish
      Pages 303-314

    11. Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable

      • Peter Franek, Stefan Ratschan, Piotr Zgliczynski
      Pages 315-326

    12. On Minimising Automata with Errors

      • Paweł Gawrychowski, Artur Jeż, Andreas Maletti
      Pages 327-338

    13. Contracting a Chordal Graph to a Split Graph or a Tree

      • Petr A. Golovach, Marcin Kamiński, Daniël Paulusma
      Pages 339-350

    14. Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages

      • Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs
      Pages 351-363

    15. A Universally Defined Undecidable Unimodal Logic

      • Edith Hemaspaandra, Henning Schnoor
      Pages 364-375

    16. On the Approximability of Minimum Topic Connected Overlay and Its Special Instances

      • Jun Hosoda, Juraj Hromkovič, Taisuke Izumi, Hirotaka Ono, Monika Steinová, Koichi Wada
      Pages 376-387

    17. Can Everybody Sit Closer to Their Friends Than Their Enemies?

      • Anne-Marie Kermarrec, Christopher Thraves
      Pages 388-399

    18. Submodularity on a Tree: Unifying \(L^\natural\)-Convex and Bisubmodular Functions

      • Vladimir Kolmogorov
      Pages 400-411

    19. Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions

      • Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
      Pages 412-423

    20. Size and Computation of Injective Tree Automatic Presentations

      • Dietrich Kuske, Thomas Weidner
      Pages 424-435
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2011

Keywords

About this book

This volume constitutes the refereed proceedings of the 36th International Symposium on Mathematical Foundations of Computer Science, MFCS 2011, held in Warsaw, Poland, in August 2011. The 48 revised full papers presented together with 6 invited talks were carefully reviewed and selected from 129 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, and theoretical issues in artificial intelligence.

Editors and Affiliations

  • Institute of Informatics, University of Warsaw, Warsaw, Poland

    Filip Murlak, Piotr Sankowski

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation