Computer Science - Theory and Applications: 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings (Lecture Notes in Computer Science, 8476)

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. Front Matter....Pages - Finding All Solutions of Equations in Free Groups and Monoids with Involution....Pages 1-15 Algorithmic Meta Theorems for Sparse Graph Classes....Pages 16-22 The Lattice of Definability. Origins, Recent Developments, and Further Directions....Pages 23-38 Counting Popular Matchings in House Allocation Problems....Pages 39-51 Vertex Disjoint Paths in Upward Planar Graphs....Pages 52-64 On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains....Pages 65-76 Testing Low Degree Trigonometric Polynomials....Pages 77-96 Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees....Pages 97-110 A Fast Branching Algorithm for Cluster Vertex Deletion....Pages 111-124 Separation Logic with One Quantified Variable....Pages 125-138 QuickXsort: Efficient Sorting with n log n − 1.399 n + o ( n ) Comparisons on Average....Pages 139-152 Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results....Pages 153-166 On the Complexity of Computing Two Nonlinearity Measures....Pages 167-175 Block Products and Nesting Negations in FO 2 ....Pages 176-189 Model Checking for String Problems....Pages 190-203 Semiautomatic Structures....Pages 204-217 The Query Complexity of Witness Finding....Pages 218-231 Primal Implication as Encryption....Pages 232-244 Processing Succinct Matrices and Vectors....Pages 245-258 Constraint Satisfaction with Counting Quantifiers 2....Pages 259-272 Dynamic Complexity of Planar 3-Connected Graph Isomorphism....Pages 273-286 Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions....Pages 287-299 First-Order Logic on CPDA Graphs....Pages 300-313 Recognizing Two-Sided Contexts in Cubic Time....Pages 314-324 A Parameterized Algorithm for Packing Overlapping Subgraphs....Pages 325-336 Crossing-Free Spanning Trees in Visibility Graphs of Points between Monotone Polygonal Obstacles....Pages 337-350 The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits....Pages 351-364 Randomized Communication Complexity of Approximating Kolmogorov Complexity....Pages 365-374 Space Saving by Dynamic Algebraization....Pages 375-388 Back Matter....Pages - This book constitutes the refereed proceedings of the Third International Computer Science Symposium in Russia, CSR 2008, held in Moscow, Russia, June 7-12, 2008. All major areas in computer science are addressed. formal languages, automata and their applications to computer science; proof theory and applications of logic to computer science.