Skip to main content
SpringerLink
Log in

Computer Science – Theory and Applications

12th International Computer Science Symposium in Russia, CSR 2017, Kazan, Russia, June 8-12, 2017, Proceedings

  • Conference proceedings
  • © 2017

Overview

Editors:
  1. Pascal Weil

    1. University of Bordeaux , Talence, 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 10304)

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

Included in the following conference series:

Conference proceedings info: CSR 2017.

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

  1. Front Matter

    Pages I-X
    Download chapter PDF

  2. Type Theory and Formalisation of Mathematics

    • Thierry Coquand
    Pages 1-6

  3. Advances in Parameterized Verification of Population Protocols

    • Javier Esparza
    Pages 7-14

  4. Verification of Quantum Computation and the Price of Trust

    • Alexandru Gheorghiu, Theodoros Kapourniotis, Elham Kashefi
    Pages 15-19

  5. Graph Sketching and Streaming: New Approaches for Analyzing Massive Graphs

    • Andrew McGregor
    Pages 20-24

  6. Concatenation Hierarchies: New Bottle, Old Wine

    • Thomas Place, Marc Zeitoun
    Pages 25-37

  7. Can We Locally Compute Sparse Connected Subgraphs?

    • Ronitt Rubinfeld
    Pages 38-47

  8. Palindromic Decompositions with Gaps and Errors

    • Michał Adamczyk, Mai Alzamel, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Jakub Radoszewski
    Pages 48-61

  9. Cascade Heap: Towards Time-Optimal Extractions

    • Maxim Babenko, Ignat Kolesnichenko, Ivan Smirnov
    Pages 62-70

  10. Entropic Uniform Sampling of Linear Extensions in Series-Parallel Posets

    • Olivier Bodini, Matthieu Dien, Antoine Genitrini, Frédéric Peschanski
    Pages 71-84

  11. Parameterized Counting of Trees, Forests and Matroid Bases

    • Cornelius Brand, Marc Roth
    Pages 85-98

  12. Generalized Dyck Shifts

    • Marie-Pierre Béal, Pavel Heller
    Pages 99-111

  13. Green’s Relations in Finite Transformation Semigroups

    • Lukas Fleischer, Manfred Kufleitner
    Pages 112-125

  14. Nondeterministic Unitary OBDDs

    • Aida Gainutdinova, Abuzer Yakaryılmaz
    Pages 126-140

  15. Unary Coded PSPACE-Complete Languages in ASPACE(loglog n)

    • Viliam Geffert
    Pages 141-153

  16. Turing Degree Spectra of Minimal Subshifts

    • Michael Hochman, Pascal Vanier
    Pages 154-161

  17. Reordering Method and Hierarchies for Quantum and Classical Ordered Binary Decision Diagrams

    • Kamil Khadiev, Aliya Khadieva
    Pages 162-175

  18. Dynamic Stabbing Queries with Sub-logarithmic Local Updates for Overlapping Intervals

    • Elena Khramtcova, Maarten Löffler
    Pages 176-190

  19. The Transformation Monoid of a Partially Lossy Queue

    • Chris Köcher, Dietrich Kuske
    Pages 191-205

  20. Approximation Algorithms for the Maximum Carpool Matching Problem

    • Gilad Kutiel
    Pages 206-216
Back to top

Other volumes

  1. Computer Science – Theory and Applications

Keywords

About this book

This book constitutes the proceedings of the 12th International Computer Science Symposium in Russia, CSR 2017, held in Kazan, Russia, in June 2017.

The 22 full papers presented in this volume were carefully reviewed and selected from 44 submissions. In addition the book contains 6 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; algorithms for concurrent and distributed systems, networks; applications of logic to computer science, e.g. proof theory, model checking and verification; formal and algorithmic aspects of bio-informatics; current challenges such as quantum computing.

Editors and Affiliations

  • University of Bordeaux , Talence, France

    Pascal Weil

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation