Mathematical Foundations of Computer Science 2013

38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings

  • Krishnendu Chatterjee
  • Jirí Sgall
Conference proceedings MFCS 2013

DOI: 10.1007/978-3-642-40313-2

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

Table of contents (74 papers)

  1. Front Matter
  2. Leah Epstein
    Pages 8-21
  3. Elias Koutsoupias
    Pages 43-44
  4. Eric Angel, Evripidis Bampis, Alexander Kononov, Dimitris Paparas, Emmanouil Pountourakis, Vassilis Zissimopoulos
    Pages 50-61
  5. Antonios Antoniadis, Chien-Chung Huang, Sebastian Ott, José Verschae
    Pages 62-73
  6. Giorgio Bacci, Giovanni Bacci, Kim G. Larsen, Radu Mardare
    Pages 74-85
  7. Vince Bárány, Michael Benedikt, Balder ten Cate
    Pages 98-110
  8. Arnold Beckmann, Pavel Pudlák, Neil Thapen
    Pages 111-122
  9. Nicolas Bedon
    Pages 123-134
  10. Michael Benedikt, Joost Engelfriet, Sebastian Maneth
    Pages 146-158
  11. Henrik Björklund, Wim Martens, Thomas Schwentick
    Pages 171-182
  12. Piero A. Bonatti, Marco Faella, Clemente Galdi, Luigi Sauro
    Pages 183-194
  13. Andreas Brandstädt, Martin Milanič, Ragnar Nevries
    Pages 195-206

About these proceedings

Introduction

This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence.

Keywords

approximation algorithms finite automata proof complexity satisfiability temporal logic

Editors and affiliations

  • Krishnendu Chatterjee
    • 1
  • Jirí Sgall
    • 2
  1. 1.Institute for Science and TechnologyKlosterneuburgAustria
  2. 2.Charles UniversityPragueCzech Republic

Bibliographic information

  • Copyright Information Springer-Verlag Berlin Heidelberg 2013
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-642-40312-5
  • Online ISBN 978-3-642-40313-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349