Skip to main content
SpringerLink
Log in

Computer Science -- Theory and Applications

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

  • Conference proceedings
  • © 2015

Overview

Editors:
  1. Lev D. Beklemishev

    1. Steklov Mathematical Institute of Russian Academy of Sciences, Lomonosov Moscow State University and National Research University Higher School of Economics, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Daniil V. Musatov

    1. Moscow Institute of Physics and Technology, Moscow, Russia and Kazan (Volga Region) Federal University, Kazan, Russia

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

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

Included in the following conference series:

Conference proceedings info: CSR 2015.

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 EPUB and 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 (27 papers)

  1. Front Matter

    Pages I-XX
    Download chapter 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
Back to top

Other volumes

  1. Computer Science -- Theory and Applications

Keywords

About this book

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.

Editors and Affiliations

  • Steklov Mathematical Institute of Russian Academy of Sciences, Lomonosov Moscow State University and National Research University Higher School of Economics, Moscow, Russia

    Lev D. Beklemishev

  • Moscow Institute of Physics and Technology, Moscow, Russia and Kazan (Volga Region) Federal University, Kazan, Russia

    Daniil V. Musatov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation