Skip to main content
SpringerLink
Log in

Computer Science – Theory and Applications

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

  • Conference proceedings
  • © 2019

Overview

Editors:
  1. René van Bevern

    1. Novosibirsk State University, Novosibirsk, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Gregory Kucherov

    1. Laboratoire d'Informatique Gaspard-Monge, Marne-la-Vallée, France

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

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

Included in the following conference series:

Conference proceedings info: CSR 2019.

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 (31 papers)

  1. Front Matter

    Pages i-xxv
    Download chapter PDF

  2. Approximability and Inapproximability for Maximum k-Edge-Colored Clustering Problem

    • Yousef M. Alhamdan, Alexander Kononov
    Pages 1-12

  3. The Non-hardness of Approximating Circuit Size

    • Eric Allender, Rahul Ilango, Neekon Vafa
    Pages 13-24

  4. Reconstructing a Convex Polygon from Its \(\omega \)-cloud

    • Elena Arseneva, Prosenjit Bose, Jean-Lou De Carufel, Sander Verdonschot
    Pages 25-37

  5. A Space-Efficient Parameterized Algorithm for the Hamiltonian Cycle Problem by Dynamic Algebraization

    • Mahdi Belbasi, Martin Fürer
    Pages 38-49

  6. Quantum Algorithm for Distribution-Free Junta Testing

    • Aleksandrs Belovs
    Pages 50-59

  7. On Induced Online Ramsey Number of Paths, Cycles, and Trees

    • Václav Blažej, Pavel Dvořák, Tomáš Valla
    Pages 60-69

  8. Approximations of Schatten Norms via Taylor Expansions

    • Vladimir Braverman
    Pages 70-79

  9. Nearly Linear Time Isomorphism Algorithms for Some Nonabelian Group Classes

    • Bireswar Das, Shivdutt Sharma
    Pages 80-92

  10. Belga B-Trees

    • Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
    Pages 93-105

  11. Eventually Dendric Shifts

    • Francesco Dolce, Dominique Perrin
    Pages 106-118

  12. On Decidability of Regular Languages Theories

    • Sergey Dudakov, Boris Karlov
    Pages 119-130

  13. Minimizing Branching Vertices in Distance-Preserving Subgraphs

    • Kshitij Gajjar, Jaikumar Radhakrishnan
    Pages 131-142

  14. On Tseitin Formulas, Read-Once Branching Programs and Treewidth

    • Ludmila Glinskih, Dmitry Itsykson
    Pages 143-155

  15. Matched Instances of Quantum Satisfiability (QSat) – Product State Solutions of Restrictions

    • Andreas Goerdt
    Pages 156-167

  16. Notes on Resolution over Linear Equations

    • Svyatoslav Gryaznov
    Pages 168-179

  17. Undecidable Word Problem in Subshift Automorphism Groups

    • Pierre Guillon, Emmanuel Jeandel, Jarkko Kari, Pascal Vanier
    Pages 180-190

  18. Parameterized Complexity of Conflict-Free Set Cover

    • Ashwin Jacob, Diptapriyo Majumdar, Venkatesh Raman
    Pages 191-202

  19. Forward Looking Huffman Coding

    • Shmuel Tomi Klein, Shoham Saadia, Dana Shapira
    Pages 203-214

  20. Computational Complexity of Real Powering and Improved Solving Linear Differential Equations

    • Ivan Koswara, Svetlana Selivanova, Martin Ziegler
    Pages 215-227
Back to top

Other volumes

  1. Computer Science – Theory and Applications

Keywords

About this book

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.

Editors and Affiliations

  • Novosibirsk State University, Novosibirsk, Russia

    René van Bevern

  • Laboratoire d'Informatique Gaspard-Monge, Marne-la-Vallée, France

    Gregory Kucherov

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation