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

DOI: 10.1007/978-3-319-20297-6

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

Table of contents

  1. Front Matter
    Pages I-XX
  2. Vladimir V. Podolskii
    Pages 7-26
  3. Mikhail Barash, Alexander Okhotin
    Pages 67-79
  4. Simone Bova, Friedrich Slivovsky
    Pages 80-93
  5. Claudia Carapelle, Shiguang Feng, Alexander Kartzow, Markus Lohrey
    Pages 94-108
  6. Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
    Pages 109-122
  7. Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos et al.
    Pages 123-142
  8. Konrad K. Dabrowski, Petr A. Golovach, Pim van ’t Hof, Daniël Paulusma, Dimitrios M. Thilikos
    Pages 143-156
  9. Mateus de Oliveira Oliveira
    Pages 157-172
  10. Volker Diekert, Florent Martin, Géraud Sénizergues, Pedro V. Silva
    Pages 173-188
  11. Manfred Droste, Vitaly Perevoshchikov
    Pages 189-203
  12. Stefan Edelkamp, Amr Elmasry, Jyrki Katajainen
    Pages 204-218
  13. Dmitry Itsykson, Mikhail Slabodkin, Dmitry Sokolov
    Pages 219-230
  14. Jozef Štefan Jirásek, Galina Jirásková, Alexander Szabari
    Pages 231-261
  15. Fairouz Kamareddine, J. B. Wells, Daniel Ventura
    Pages 262-282
  16. Alexander Knop
    Pages 283-295

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

  • 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