Skip to main content
SpringerLink
Log in
Book cover

Computer Science – Theory and Applications

13th International Computer Science Symposium in Russia, CSR 2018, Moscow, Russia, June 6–10, 2018, Proceedings

  • Conference proceedings
  • © 2018

Overview

Editors:
  1. Fedor V. Fomin

    1. Department of Informatics, University of Bergen, Bergen, Norway

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Vladimir V. Podolskii

    1. Steklov Mathematical Institute, Moscow, Russia

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

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

Included in the following conference series:

Conference proceedings info: CSR 2018.

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 84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.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 (27 papers)

  1. Front Matter

    Pages I-XXXII
    Download chapter PDF

  2. Complexity of Generation

    • Vladimir Gurvich
    Pages 1-14

  3. Lower Bounds for Unrestricted Boolean Circuits: Open Problems

    • Alexander S. Kulikov
    Pages 15-22

  4. Online Labeling: Algorithms, Lower Bounds and Open Questions

    • Michael Saks
    Pages 23-28

  5. Maintaining Chordal Graphs Dynamically: Improved Upper and Lower Bounds

    • Niranka Banerjee, Venkatesh Raman, Srinivasa Rao Satti
    Pages 29-40

  6. Distributed Symmetry-Breaking Algorithms for Congested Cliques

    • Leonid Barenboim, Victor Khazanov
    Pages 41-52

  7. The Clever Shopper Problem

    • Laurent Bulteau, Danny Hermelin, Anthony Labarre, Stéphane Vialette
    Pages 53-64

  8. A Tight Lower Bound for Steiner Orientation

    • Rajesh Chitnis, Andreas Emil Feldmann
    Pages 65-77

  9. Can We Create Large k-Cores by Adding Few Edges?

    • Rajesh Chitnis, Nimrod Talmon
    Pages 78-89

  10. Periodicity in Data Streams with Wildcards

    • Funda Ergün, Elena Grigorescu, Erfan Sadeqi Azer, Samson Zhou
    Pages 90-105

  11. Maximum Colorful Cycles in Vertex-Colored Graphs

    • Giuseppe F. Italiano, Yannis Manoussakis, Nguyen Kim Thang, Hong Phong Pham
    Pages 106-117

  12. Grammar-Based Compression of Unranked Trees

    • Adrià Gascón, Markus Lohrey, Sebastian Maneth, Carl Philipp Reh, Kurt Sieber
    Pages 118-131

  13. Complement for Two-Way Alternating Automata

    • Viliam Geffert
    Pages 132-144

  14. Closure Under Reversal of Languages over Infinite Alphabets

    • Daniel Genkin, Michael Kaminski, Liat Peterfreund
    Pages 145-156

  15. Structural Parameterizations of Dominating Set Variants

    • Dishant Goyal, Ashwin Jacob, Kaushtubh Kumar, Diptapriyo Majumdar, Venkatesh Raman
    Pages 157-168

  16. Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing

    • Sören Henning, Klaus Jansen, Malin Rau, Lars Schmarje
    Pages 169-180

  17. Operations on Boolean and Alternating Finite Automata

    • Michal Hospodár, Galina Jirásková, Ivana Krajňáková
    Pages 181-193

  18. Conflict Free Version of Covering Problems on Graphs: Classical and Parameterized

    • Pallavi Jain, Lawqueen Kanesh, Pranabendu Misra
    Pages 194-206

  19. Quadratically Tight Relations for Randomized Query Complexity

    • Rahul Jain, Hartmut Klauck, Srijita Kundu, Troy Lee, Miklos Santha, Swagato Sanyal et al.
    Pages 207-219

  20. On Vertex Coloring Without Monochromatic Triangles

    • Michał Karpiński, Krzysztof Piecuch
    Pages 220-231
Back to top

Other volumes

  1. Computer Science – Theory and Applications

Keywords

About this book

This book constitutes the proceedings of the 13th International Computer Science Symposium in Russia, CSR 2018, held in Moscow, Russia, in May 2018.

The 24 full papers presented together with 7 invited lectures were carefully reviewed and selected from 42 submissions.  The papers cover a wide range of topics such as algorithms and data structures; combinatorial optimization; constraint solving; computational complexity; cryptography; combinatorics in computer science; formal languages and automata; algorithms for concurrent and distributed systems; networks; and proof theory and applications of logic to computer science.  

Editors and Affiliations

  • Department of Informatics, University of Bergen, Bergen, Norway

    Fedor V. Fomin

  • Steklov Mathematical Institute, Moscow, Russia

    Vladimir V. Podolskii

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation