Computer Science – Theory and Applications

11th International Computer Science Symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9-13, 2016, Proceedings

  • Alexander S. Kulikov
  • Gerhard J. Woeginger

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

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

Table of contents

  1. Front Matter
    Pages I-XXI
  2. Orna Kupferman
    Pages 1-15
  3. Andris Ambainis, Krišjānis Prūsis, Jevgēnijs Vihrovs
    Pages 16-28
  4. Mike Behrisch, Miki Hermann, Stefan Mengel, Gernot Salzer
    Pages 41-56
  5. René van Bevern, Vincent Froese, Christian Komusiewicz
    Pages 57-72
  6. Manuel Bodirsky, Marcello Mamino
    Pages 88-101
  7. Kateřina Böhmová, Matúš Mihalák, Tobias Pröger, Gustavo Sacomoto, Marie-France Sagot
    Pages 102-116
  8. Patricia Bouyer, Thomas Brihaye, Pierre Carlier, Quentin Menet
    Pages 117-130
  9. Joan Boyar, Leah Epstein, Lene M. Favrholdt, Kim S. Larsen, Asaf Levin
    Pages 131-145
  10. Alejandro Díaz-Caro, Abuzer Yakaryılmaz
    Pages 146-160
  11. Toshihiro Fujito, Tomoaki Shimoda
    Pages 161-176
  12. Petr A. Golovach, George B. Mertzios
    Pages 177-191
  13. Shankar Balachandran, Sajin Koroth
    Pages 192-206
  14. Alexander Kozachinskiy
    Pages 207-222
  15. Manfred Kufleitner, Tobias Walter
    Pages 223-236
  16. Manfred Kufleitner, Jan Philipp Wächter
    Pages 237-250
  17. Meena Mahajan, Anuj Tawari
    Pages 266-279

About these proceedings


This book constitutes the proceedings of the 11th International Computer Science Symposium in Russia, CSR 2016, held in St. Petersburg, Russia, in June 2016.

The 28 full papers presented in this volume were carefully reviewed and selected from 71 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 such as: include, but are not limited to: algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; computational models and concepts; algorithms for concurrent and distributed systems, networks; proof theory and applications of logic to computer science; model checking; automated reasoning; and deductive methods.


Models of computation Formal languages and automata theory Computational complexity and cryptography Logic Design and analysis of algorithms Discrete mathematics Symbolic and algebraic manipulation Parallel computing methodologies Machine learning Operations research machine learning approximation algorithm automata theory communication complexity computable analysis constraint satisfaction problem denoising information complexity NP-hard problem operations research parallel computing methodologies statistics

Editors and affiliations

  • Alexander S. Kulikov
    • 1
  • Gerhard J. Woeginger
    • 2
  1. 1.Russian Academy of SciencesSt. PetersburgRussia
  2. 2.Technische Universiteit EindhovenEindhovenThe Netherlands

Bibliographic information

  • DOI
  • Copyright Information Springer International Publishing Switzerland 2016
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-34170-5
  • Online ISBN 978-3-319-34171-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • About this book