Advertisement

Mathematical Foundations of Computer Science 2011

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

  • Filip Murlak
  • Piotr Sankowski
Conference proceedings MFCS 2011

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

Table of contents

  1. Front Matter
    PDF

  2. Invited Papers

    1. Nearest Neighbor Search in High-Dimensional Spaces
      Alexandr Andoni
      Pages 1-1
    2. Invariantization of Listings
      Jörg Flum
      Pages 2-2
    3. Duality and Recognition
      Mai Gehrke
      Pages 3-18
    4. Some Variants of the Star Height Problem
      Daniel Kirsten
      Pages 19-33
    5. Generic Techniques to Round SDP Relaxations
      Prasad Raghavendra
      Pages 34-34
    6. New Proofs in Graph Minors
      Paul Wollan
      Pages 35-35

  3. Contributed Papers

    1. The Least-Core of Threshold Network Flow Games
      Yoram Bachrach
      Pages 36-47
    2. Adhesivity Is Not Enough: Local Church-Rosser Revisited
      Paolo Baldan, Fabio Gadducci, Pawel Sobociński
      Pages 48-59
    3. Quantitative Refinement for Weighted Modal Transition Systems
      Sebastian S. Bauer, Uli Fahrenberg, Line Juhl, Kim G. Larsen, Axel Legay, Claus Thrane
      Pages 60-71
    4. Faster Coupon Collecting via Replication with Applications in Gossiping
      Petra Berenbrink, Robert Elsässer, Tom Friedetzky, Lars Nagel, Thomas Sauerwald
      Pages 72-83
    5. Verifying Proofs in Constant Depth
      Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas et al.
      Pages 84-95
    6. The Complexity of the Cover Polynomials for Planar Graphs of Bounded Degree
      Markus Bläser, Radu Curticapean
      Pages 96-107
    7. Model Checking Coverability Graphs of Vector Addition Systems
      Michel Blockelet, Sylvain Schmitz
      Pages 108-119
    8. Hard Functions for Low-Degree Polynomials over Prime Fields
      Andrej Bogdanov, Akinori Kawachi, Hidetoki Tanaka
      Pages 120-131
    9. Temporal Logics for Concurrent Recursive Programs: Satisfiability and Model Checking
      Benedikt Bollig, Aiswarya Cyriac, Paul Gastin, Marc Zeitoun
      Pages 132-144
    10. The Reachability Problem for Vector Addition System with One Zero-Test
      Rémi Bonnet
      Pages 145-157
    11. The Bounded Search Tree Algorithm for the Closest String Problem Has Quadratic Smoothed Complexity
      Christina Boucher
      Pages 158-169
    12. Solving Analytic Differential Equations in Polynomial Time over Unbounded Domains
      Olivier Bournez, Daniel S. Graça, Amaury Pouly
      Pages 170-181
    13. Pattern-Guided Data Anonymization and Clustering
      Robert Bredereck, André Nichterlein, Rolf Niedermeier, Geevarghese Philip
      Pages 182-193
    14. Language Equivalence of Deterministic Real-Time One-Counter Automata Is NL-Complete
      Stanislav Böhm, Stefan Göller
      Pages 194-205
    15. Energy and Mean-Payoff Parity Markov Decision Processes
      Krishnendu Chatterjee, Laurent Doyen
      Pages 206-218
    16. The Role of Polymorphism in the Characterisation of Complexity by Soft Types
      Jacek Chrząszcz, Aleksy Schubert
      Pages 219-230
    17. 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
    18. On the Use of Guards for Logics with Data
      Thomas Colcombet, Clemens Ley, Gabriele Puppis
      Pages 243-255
    19. 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
    20. On the Complexity of the l-diversity Problem
      Riccardo Dondi, Giancarlo Mauri, Italo Zoppis
      Pages 266-277
    21. Infinite Synchronizing Words for Probabilistic Automata
      Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi
      Pages 278-289
    22. Characterizing EF over Infinite Trees and Modal Logic on Transitive Graphs
      Balder ten Cate, Alessandro Facchini
      Pages 290-302
    23. Parity Games on Graphs with Medium Tree-Width
      John Fearnley, Oded Lachish
      Pages 303-314
    24. Satisfiability of Systems of Equations of Real Analytic Functions Is Quasi-decidable
      Peter Franek, Stefan Ratschan, Piotr Zgliczynski
      Pages 315-326
    25. On Minimising Automata with Errors
      Paweł Gawrychowski, Artur Jeż, Andreas Maletti
      Pages 327-338
    26. Contracting a Chordal Graph to a Split Graph or a Tree
      Petr A. Golovach, Marcin Kamiński, Daniël Paulusma
      Pages 339-350
    27. Quantum Finite Automata and Probabilistic Reversible Automata: R-trivial Idempotent Languages
      Marats Golovkins, Maksim Kravtsev, Vasilijs Kravcevs
      Pages 351-363
    28. A Universally Defined Undecidable Unimodal Logic
      Edith Hemaspaandra, Henning Schnoor
      Pages 364-375
    29. 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
    30. Can Everybody Sit Closer to Their Friends Than Their Enemies?
      Anne-Marie Kermarrec, Christopher Thraves
      Pages 388-399
    31. Submodularity on a Tree: Unifying \(L^\natural\)-Convex and Bisubmodular Functions
      Vladimir Kolmogorov
      Pages 400-411
    32. Streaming Algorithms for Recognizing Nearly Well-Parenthesized Expressions
      Andreas Krebs, Nutan Limaye, Srikanth Srinivasan
      Pages 412-423
    33. Size and Computation of Injective Tree Automatic Presentations
      Dietrich Kuske, Thomas Weidner
      Pages 424-435
    34. Symmetric Functions Capture General Functions
      Richard J. Lipton, Kenneth W. Regan, Atri Rudra
      Pages 436-447
    35. Compressed Word Problems for Inverse Monoids
      Markus Lohrey
      Pages 448-459
    36. Pushing for Weighted Tree Automata
      Andreas Maletti, Daniel Quernheim
      Pages 460-471
    37. Periodicity Algorithms for Partial Words
      Florin Manea, Robert Mercaş, Cătălin Tiseanu
      Pages 472-484
    38. State Complexity of Operations on Input-Driven Pushdown Automata
      Alexander Okhotin, Kai Salomaa
      Pages 485-496
    39. Conflict Packing Yields Linear Vertex-Kernels for k-FAST, k-dense RTI and a Related Problem
      Christophe Paul, Anthony Perez, Stéphan Thomassé
      Pages 497-507
    40. Transduction on Kadanoff Sand Pile Model Avalanches, Application to Wave Pattern Emergence
      Kevin Perrot, Eric Rémila
      Pages 508-519
    41. Problems Parameterized by Treewidth Tractable in Single Exponential Time: A Logical Approach
      Michał Pilipczuk
      Pages 520-531
    42. Distributed Synthesis for Regular and Contextfree Specifications
      Wladimir Fridman, Bernd Puchala
      Pages 532-543
    43. Geometric Graphs with Randomly Deleted Edges - Connectivity and Routing Protocols
      K. Krzywdziński, K. Rybarczyk
      Pages 544-555

About these proceedings

Introduction

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.

Keywords

constraint optimization finite automata graph drawing modal logic weighted polymorphisms

Editors and affiliations

  • Filip Murlak
    • 1
  • Piotr Sankowski
    • 1
  1. 1.Institute of InformaticsUniversity of WarsawWarsawPoland

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-642-22993-0
  • Copyright Information Springer-Verlag Berlin Heidelberg 2011
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-22992-3
  • Online ISBN 978-3-642-22993-0
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
Biotechnology
Finance, Business & Banking
Electronics
IT & Software
Telecommunications
Energy, Utilities & Environment
Engineering