Skip to main content
SpringerLink
Log in
Book cover

Mathematical Foundations of Computer Science 2014

39th International Symposium, MFCS 2014, Budapest, Hungary, August 26-29, 2014. Proceedings, Part II

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Erzsébet Csuhaj-Varjú

    1. Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Martin Dietzfelbinger

    1. Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Ilmenau, Germany

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Zoltán Ésik

    1. Institute of Informatics, Szeged University, Szeged, Hungary

    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 8635)

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

Included in the following conference series:

Conference proceedings info: MFCS 2014.

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

  1. Front Matter

    Download chapter PDF

  2. Algorithms, Complexity and Games

    1. On r-Simple k-Path

      • Hasan Abasi, Nader H. Bshouty, Ariel Gabizon, Elad Haramaty
      Pages 1-12

    2. Low-Depth Uniform Threshold Circuits and the Bit-Complexity of Straight Line Programs

      • Eric Allender, Nikhil Balaji, Samir Datta
      Pages 13-24

    3. Zero Knowledge and Circuit Minimization

      • Eric Allender, Bireswar Das
      Pages 25-32

    4. A Tight Lower Bound on Certificate Complexity in Terms of Block Sensitivity and Sensitivity

      • Andris Ambainis, Krišjānis Prūsis
      Pages 33-44

    5. \(\widetilde{O}(\sqrt{n})\)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability

      • Tetsuo Asano, David Kirkpatrick, Kotaro Nakagawa, Osamu Watanabe
      Pages 45-56

    6. Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set

      • Rémy Belmonte, Pim van ’t Hof, Marcin Kamiński, Daniël Paulusma
      Pages 57-68

    7. Network-Based Dissolution

      • René van Bevern, Robert Bredereck, Jiehua Chen, Vincent Froese, Rolf Niedermeier, Gerhard J. Woeginger
      Pages 69-80

    8. On Unification of QBF Resolution-Based Calculi

      • Olaf Beyersdorff, Leroy Chew, Mikoláš Janota
      Pages 81-93

    9. Minimum Planar Multi-sink Cuts with Connectivity Priors

      • Ivona Bezáková, Zachary Langley
      Pages 94-105

    10. The Price of Envy-Freeness in Machine Scheduling

      • Vittorio Bilò, Angelo Fanelli, Michele Flammini, Gianpiero Monaco, Luca Moscardelli
      Pages 106-117

    11. On the Complexity of Some Ordering Problems

      • Beate Bollig
      Pages 118-129

    12. The Relationship between Multiplicative Complexity and Nonlinearity

      • Joan Boyar, Magnus Gausdal Find
      Pages 130-140

    13. Dual Connectedness of Edge-Bicolored Graphs and Beyond

      • Leizhen Cai, Junjie Ye
      Pages 141-152

    14. Combinatorial Voter Control in Elections

      • Jiehua Chen, Piotr Faliszewski, Rolf Niedermeier, Nimrod Talmon
      Pages 153-164

    15. An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas

      • Ruiwen Chen, Valentine Kabanets, Nitin Saurabh
      Pages 165-176

    16. On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields

      • Suryajith Chillara, Partha Mukhopadhyay
      Pages 177-188

    17. Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth

      • Marek Cygan, Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk
      Pages 189-200

    18. Probabilistic Analysis of Power Assignments

      • Maurits de Graaf, Bodo Manthey
      Pages 201-212

    19. Existence of Secure Equilibrium in Multi-player Games with Perfect Information

      • Julie De Pril, János Flesch, Jeroen Kuipers, Gijs Schoenmakers, Koos Vrieze
      Pages 213-225
Back to top

Other volumes

  1. Mathematical Foundations of Computer Science 2014

  2. Mathematical Foundations of Computer Science 2014

Keywords

About this book

This two volume set LNCS 8634 and LNCS 8635 constitutes the refereed conference proceedings of the 39th International Symposium on Mathematical Foundations of Computer Science, MFCS 2014, held in Budapest, Hungary, in August 2014. The 95 revised full papers presented together with 6 invited talks were carefully selected from 270 submissions. The focus of the conference was on following topics: Logic, Semantics, Automata, Theory of Programming, Algorithms, Complexity, Parallel and Distributed Computing, Quantum Computing, Automata, Grammars and Formal Languages, Combinatorics on Words, Trees and Games.

Editors and Affiliations

  • Faculty of Informatics, Eötvös Loránd University, Budapest, Hungary

    Erzsébet Csuhaj-Varjú

  • Fakultät für Informatik und Automatisierung, Technische Universität Ilmenau, Ilmenau, Germany

    Martin Dietzfelbinger

  • Institute of Informatics, Szeged University, Szeged, Hungary

    Zoltán Ésik

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation