Skip to main content
SpringerLink
Log in
Book cover

Computer Science - Theory and Applications

9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings

  • Conference proceedings
  • © 2014

Overview

Editors:
  1. Edward A. Hirsch

    1. Steklov Institute of Mathematics at St. Petersburg, Russian Academy of Sciences, St. Petersburg, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  2. Sergei O. Kuznetsov

    1. Higher School of Economics, National Research University, Moscow, Russia

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  3. Jean-Éric Pin

    1. CNRS and University Paris Diderot, Paris, France

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

  4. Nikolay K. Vereshchagin

    1. Moscow State University, 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 8476)

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

Included in the following conference series:

Conference proceedings info: CSR 2014.

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

  1. Front Matter

    Download chapter PDF

  2. Finding All Solutions of Equations in Free Groups and Monoids with Involution

    • Volker Diekert, Artur Jeż, Wojciech Plandowski
    Pages 1-15

  3. Algorithmic Meta Theorems for Sparse Graph Classes

    • Martin Grohe
    Pages 16-22

  4. The Lattice of Definability. Origins, Recent Developments, and Further Directions

    • Alexei Semenov, Sergey Soprunov, Vladimir Uspensky
    Pages 23-38

  5. Counting Popular Matchings in House Allocation Problems

    • Rupam Acharyya, Sourav Chakraborty, Nitesh Jha
    Pages 39-51

  6. Vertex Disjoint Paths in Upward Planar Graphs

    • Saeed Akhoondian Amiri, Ali Golshani, Stephan Kreutzer, Sebastian Siebertz
    Pages 52-64

  7. On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains

    • V. Arvind, S. Raja, A. V. Sreejith
    Pages 65-76

  8. Testing Low Degree Trigonometric Polynomials

    • Martijn Baartse, Klaus Meer
    Pages 77-96

  9. Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees

    • Abhishek Bhrushundi, Sourav Chakraborty, Raghav Kulkarni
    Pages 97-110

  10. A Fast Branching Algorithm for Cluster Vertex Deletion

    • Anudhyan Boral, Marek Cygan, Tomasz Kociumaka, Marcin Pilipczuk
    Pages 111-124

  11. Separation Logic with One Quantified Variable

    • Stéphane Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry
    Pages 125-138

  12. QuickXsort: Efficient Sorting with n logn − 1.399n + o(n) Comparisons on Average

    • Stefan Edelkamp, Armin Weiß
    Pages 139-152

  13. Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results

    • Henning Fernau, Juan Alberto Rodríguez-Velázquez
    Pages 153-166

  14. On the Complexity of Computing Two Nonlinearity Measures

    • Magnus Gausdal Find
    Pages 167-175

  15. Block Products and Nesting Negations in FO2

    • Lukas Fleischer, Manfred Kufleitner, Alexander Lauser
    Pages 176-189

  16. Model Checking for String Problems

    • Milka Hutagalung, Martin Lange
    Pages 190-203

  17. Semiautomatic Structures

    • Sanjay Jain, Bakhadyr Khoussainov, Frank Stephan, Dan Teng, Siyuan Zou
    Pages 204-217

  18. The Query Complexity of Witness Finding

    • Akinori Kawachi, Benjamin Rossman, Osamu Watanabe
    Pages 218-231

  19. Primal Implication as Encryption

    • Vladimir N. Krupski
    Pages 232-244

  20. Processing Succinct Matrices and Vectors

    • Markus Lohrey, Manfred Schmidt-Schauß
    Pages 245-258
Back to top

Other volumes

  1. Computer Science - Theory and Applications

Keywords

About this book

This book constitutes the proceedings of the 9th International Computer Science Symposium in Russia, CSR 2014, held in Moscow, Russia, in June 2014. The 27 full papers presented in this volume were carefully reviewed and selected from 76 submissions. In addition the book contains 4 invited lectures. The scope of the proposed topics is quite broad and covers a wide range of areas in theoretical computer science and its applications.

Editors and Affiliations

  • Steklov Institute of Mathematics at St. Petersburg, Russian Academy of Sciences, St. Petersburg, Russia

    Edward A. Hirsch

  • Higher School of Economics, National Research University, Moscow, Russia

    Sergei O. Kuznetsov

  • CNRS and University Paris Diderot, Paris, France

    Jean-Éric Pin

  • Moscow State University, Moscow, Russia

    Nikolay K. Vereshchagin

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation