Advertisement

Computer Science - Theory and Applications

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

  • Edward A. Hirsch
  • Sergei O. Kuznetsov
  • Jean-Éric Pin
  • Nikolay K. Vereshchagin
Conference proceedings CSR 2014

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

Table of contents

  1. Front Matter
    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
  21. Constraint Satisfaction with Counting Quantifiers 2
    Barnaby Martin, Juraj Stacho
    Pages 259-272
  22. Dynamic Complexity of Planar 3-Connected Graph Isomorphism
    Jenish C. Mehta
    Pages 273-286
  23. Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions
    Victor Y. Pan
    Pages 287-299
  24. First-Order Logic on CPDA Graphs
    Paweł Parys
    Pages 300-313
  25. Recognizing Two-Sided Contexts in Cubic Time
    Max Rabkin
    Pages 314-324
  26. A Parameterized Algorithm for Packing Overlapping Subgraphs
    Jazmń Romero, Alejandro López-Ortiz
    Pages 325-336
  27. Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles
    Julia Schüler, Andreas Spillner
    Pages 337-350
  28. The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits
    Konrad Schwerdtfeger
    Pages 351-364
  29. Randomized Communication Complexity of Approximating Kolmogorov Complexity
    Nikolay Vereshchagin
    Pages 365-374
  30. Space Saving by Dynamic Algebraization
    Martin Fürer, Huiwen Yu
    Pages 375-388
  31. Back Matter
    PDF

About these proceedings

Introduction

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.

Keywords

approximation algorithms computational complexity discrete mathematics graph algorithms graph theory mathematical analysis numerical analysis theoretical computer science theory of computation

Editors and affiliations

  • Edward A. Hirsch
    • 1
  • Sergei O. Kuznetsov
    • 2
  • Jean-Éric Pin
    • 3
  • Nikolay K. Vereshchagin
    • 4
  1. 1.Steklov Institute of Mathematics at St. PetersburgRussian Academy of SciencesSt. PetersburgRussia
  2. 2.Higher School of EconomicsNational Research UniversityMoscowRussia
  3. 3.CNRS and University Paris DiderotParisFrance
  4. 4.Moscow State UniversityMoscowRussia

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-319-06686-8
  • Copyright Information Springer International Publishing Switzerland 2014
  • Publisher Name Springer, Cham
  • eBook Packages Computer Science
  • Print ISBN 978-3-319-06685-1
  • Online ISBN 978-3-319-06686-8
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site