Skip to main content
  • Conference proceedings
  • © 2020

Computer Science – Theory and Applications

15th International Computer Science Symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings

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

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

Conference series link(s): CSR: International Computer Science Symposium in Russia

Conference proceedings info: CSR 2020.

Buy it now

Buying options

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

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (31 papers)

  1. Front Matter

    Pages i-xi
  2. Quantum Hashing and Fingerprinting for Quantum Cryptography and Computations

    • Farid Ablayev, Marat Ablayev, Alexander Vasiliev
    Pages 1-15
  3. Parameterized Analysis of Art Gallery and Terrain Guarding

    • Akanksha Agrawal, Meirav Zehavi
    Pages 16-29
  4. Central Positions in Social Networks

    • Ulrik Brandes
    Pages 30-45
  5. Second-Order Finite Automata

    • Alexsander Andrade de Melo, Mateus de Oliveira Oliveira
    Pages 46-63
  6. Isomorphic Distances Among Elections

    • Piotr Faliszewski, Piotr Skowron, Arkadii Slinko, Stanisław Szufa, Nimrod Talmon
    Pages 64-78
  7. Faster 2-Disjoint-Shortest-Paths Algorithm

    • Maxim Akhmedov
    Pages 103-116
  8. An Improvement to Chvátal and Thomassen’s Upper Bound for Oriented Diameter

    • Jasine Babu, Deepu Benson, Deepak Rajendraprasad, Sai Nishant Vaka
    Pages 117-129
  9. Families of Monotonic Trees: Combinatorial Enumeration and Asymptotics

    • Olivier Bodini, Antoine Genitrini, Mehdi Naima, Alexandros Singh
    Pages 155-168
  10. Nested Regular Expressions Can Be Compiled to Small Deterministic Nested Word Automata

    • Iovka Boneva, Joachim Niehren, Momar Sakho
    Pages 169-183
  11. On the Decision Tree Complexity of Threshold Functions

    • Anastasiya Chistopolskaya, Vladimir V. Podolskii
    Pages 198-210
  12. Randomized and Symmetric Catalytic Computation

    • Samir Datta, Chetan Gupta, Rahul Jain, Vimal Raj Sharma, Raghunath Tewari
    Pages 211-223
  13. On the Parameterized Complexity of the Expected Coverage Problem

    • Fedor V. Fomin, Vijayaragunathan Ramamoorthi
    Pages 224-236
  14. Computational Hardness of Multidimensional Subtraction Games

    • Vladimir Gurvich, Mikhail Vyalyi
    Pages 237-249
  15. Parameterized Complexity of Fair Feedback Vertex Set Problem

    • Lawqueen Kanesh, Soumen Maity, Komal Muluk, Saket Saurabh
    Pages 250-262
  16. The Power of Leibniz-Like Functions as Oracles

    • Jaeyoon Kim, Ilya Volkovich, Nelson Xuzhi Zhang
    Pages 263-275

Other Volumes

  1. Computer Science – Theory and Applications

About this book

This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020.

The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.

 The conference was cancelled as a live conference due to the corona pandemic.

Editors and Affiliations

  • University of Trier, Trier, Germany

    Henning Fernau

Bibliographic Information

Buy it now

Buying options

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