Advertisement

Computer Science -- Theory and Applications

10th International Computer Science Symposium in Russia, CSR 2015, Listvyanka, Russia, July 13-17, 2015, Proceedings

  • Lev D. Beklemishev
  • Daniil V. Musatov
Conference proceedings CSR 2015

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

Also part of the Theoretical Computer Science and General Issues book sub series (LNTCS, volume 9139)

Table of contents

  1. Front Matter
    Pages I-XX
    PDF
  2. Propositional Proofs in Frege and Extended Frege Systems (Abstract)
    Sam Buss
    Pages 1-6
  3. Circuit Complexity Meets Ontology-Based Data Access
    Vladimir V. Podolskii
    Pages 7-26
  4. NEXP-Completeness and Universal Hardness Results for Justification Logic
    Antonis Achilleos
    Pages 27-52
  5. A Combinatorial Algorithm for the Planar Multiflow Problem with Demands Located on Three Holes
    Maxim A. Babenko, Alexander V. Karzanov
    Pages 53-66
  6. Generalized LR Parsing for Grammars with Contexts
    Mikhail Barash, Alexander Okhotin
    Pages 67-79
  7. On Compiling Structured CNFs to OBDDs
    Simone Bova, Friedrich Slivovsky
    Pages 80-93
  8. Satisfiability of ECTL* with Tree Constraints
    Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
    Pages 94-108
  9. On Growth and Fluctuation of k-Abelian Complexity
    Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
    Pages 109-122
  10. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement
    Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos et al.
    Pages 123-142
  11. Editing to a Planar Graph of Given Degrees
    Konrad K. Dabrowski, Petr A. Golovach, Pim van ’t Hof, Daniël Paulusma, Dimitrios M. Thilikos
    Pages 143-156
  12. On the Satisfiability of Quantum Circuits of Small Treewidth
    Mateus de Oliveira Oliveira
    Pages 157-172
  13. Equations over Free Inverse Monoids with Idempotent Variables
    Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
    Pages 173-188
  14. A Logical Characterization of Timed Pushdown Languages
    Manfred Droste, Vitaly Perevoshchikov
    Pages 189-203
  15. An In-Place Priority Queue with O(1) Time for Push and \(\lg n + O(1)\) Comparisons for Pop
    Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
    Pages 204-218
  16. Resolution Complexity of Perfect Matching Principles for Sparse Graphs
    Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov
    Pages 219-230
  17. Operations on Self-Verifying Finite Automata
    Jozef Štefan Jirásek, Galina Jirásková, Alexander Szabari
    Pages 231-261
  18. Automath Type Inclusion in Barendregt’s Cube
    Fairouz Kamareddine, J. B. Wells, Daniel Ventura
    Pages 262-282
  19. Circuit Lower Bounds for Average-Case MA
    Alexander Knop
    Pages 283-295
  20. Making Randomness Public in Unbounded-Round Information Complexity
    Alexander Kozachinskiy
    Pages 296-309
  21. First-Order Logic Definability of Free Languages
    Violetta Lonati, Dino Mandrioli, Federica Panella, Matteo Pradella
    Pages 310-324
  22. Representation of (Left) Ideal Regular Languages by Synchronizing Automata
    Marina Maslennikova, Emanuele Rodaro
    Pages 325-338
  23. Some Properties of Antistochastic Strings
    Alexey Milovanov
    Pages 339-349
  24. Approximation and Exact Algorithms for Special Cases of Connected f-Factors
    N. S. Narayanaswamy, C. S. Rahul
    Pages 350-363
  25. Rewriting Higher-Order Stack Trees
    Vincent Penelle
    Pages 364-397
  26. Interacting with Modal Logics in the Coq Proof Assistant
    Christoph Benzmüller, Bruno Woltzenlogel Paleo
    Pages 398-411
  27. Delay Games with WMSO\(+\)U Winning Conditions
    Martin Zimmermann
    Pages 412-425
  28. Asymptotically Precise Ranking Functions for Deterministic Size-Change Systems
    Florian Zuleger
    Pages 426-442
  29. Back Matter
    Pages 443-443
    PDF

About these proceedings

Introduction

This book constitutes the proceedings of the 10th International Computer Science Symposium in Russia, CSR 2015, held in Listvyanka, Russia, in July 2015.

The 25 full papers presented in this volume were carefully reviewed and selected from 61 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

Keywords

Approximation algorithms Computational complexity Discrete mathematics Formal grammars Graph algorithms Graph theory Kolmogorov complexity Planar graph Polynomial-time algorithms Proof complexity Reset complexity Satisfiability of quantum circuits Shift-reduce Strongly connected automaton Strongly polynomial algorithm Synchronizing automaton Theory of computation Timed languages Timed pushdown automata Visibly pushdown languages

Editors and affiliations

  • Lev D. Beklemishev
    • 1
  • Daniil V. Musatov
    • 2
  1. 1.Steklov Mathematical Institute of Russian Academy of Sciences, Lomonosov Moscow State University and National Research University Higher School of EconomicsMoscowRussia
  2. 2.Moscow Institute of Physics and Technology, Moscow, Russia and Kazan (Volga Region) Federal UniversityKazanRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-20297-6
  • Copyright Information Springer International Publishing Switzerland 2015
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-20296-9
  • Online ISBN 978-3-319-20297-6
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site