Advertisement

© 2019

Computer Science – Theory and Applications

14th International Computer Science Symposium in Russia, CSR 2019, Novosibirsk, Russia, July 1–5, 2019, Proceedings

  • René van Bevern
  • Gregory Kucherov
Conference proceedings CSR 2019

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

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

Table of contents

  1. Front Matter
    Pages i-xxv
  2. Eric Allender, Rahul Ilango, Neekon Vafa
    Pages 13-24
  3. Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot
    Pages 25-37
  4. Václav Blažej, Pavel Dvořák, Tomáš Valla
    Pages 60-69
  5. Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
    Pages 93-105
  6. Francesco Dolce, Dominique Perrin
    Pages 106-118
  7. Sergey Dudakov, Boris Karlov
    Pages 119-130
  8. Kshitij Gajjar, Jaikumar Radhakrishnan
    Pages 131-142
  9. Ludmila Glinskih, Dmitry Itsykson
    Pages 143-155
  10. Svyatoslav Gryaznov
    Pages 168-179
  11. Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier
    Pages 180-190
  12. Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
    Pages 191-202
  13. Shmuel Tomi Klein, Shoham Saadia, Dana Shapira
    Pages 203-214
  14. Ivan Koswara, Svetlana Selivanova, Martin Ziegler
    Pages 215-227

About these proceedings

Introduction

This book constitutes the proceedings of the 14th International Computer Science Symposium in Russia, CSR 2019, held in Novosibirsk, Russia, in July 2019.

The 31 full papers were carefully reviewed and selected from 71 submissions. The papers cover a wide range of topics such as algorithms and data structures; computational complexity; randomness in computing; approximation algorithms; combinatorial optimization; constraint satisfaction; computational geometry; formal languages and automata; codes and cryptography; combinatorics in computer science; applications of logic to computer science; proof complexity; fundamentals of machine learning; and theoretical aspects of big data.

Keywords

approximation algorithms artificial intelligence computational complexity data mining databases graph theory machine learning parameterized complexity problem solving semantics

Editors and affiliations

  1. 1.Novosibirsk State UniversityNovosibirskRussia
  2. 2.Laboratoire d'Informatique Gaspard-MongeMarne-la-ValléeFrance

Bibliographic information