05080nam 22008415 450 991048455320332120230221004124.03-319-06686-210.1007/978-3-319-06686-8(CKB)3710000000143817(SSID)ssj0001275073(PQKBManifestationID)11810318(PQKBTitleCode)TC0001275073(PQKBWorkID)11334217(PQKB)11550526(DE-He213)978-3-319-06686-8(MiAaPQ)EBC3093137(PPN)179765973(EXLCZ)99371000000014381720140602d2014 u| 0engurnn#008mamaatxtccrComputer Science - Theory and Applications 9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings /edited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin1st ed. 2014.Cham :Springer International Publishing :Imprint: Springer,2014.1 online resource (XX, 389 p. 39 illus.)Theoretical Computer Science and General Issues,2512-2029 ;8476Bibliographic Level Mode of Issuance: Monograph3-319-06685-4 Includes bibliographical references and author index.Finding All Solutions of Equations in Free Groups and Monoids with Involution -- Algorithmic Meta Theorems for Sparse Graph Classes -- The Lattice of Definability -- Counting Popular Matchings in House Allocation Problems -- Vertex Disjoint Paths in Upward Planar Graphs -- On Lower Bounds for Multiplicative Circuits and Linear Circuits in Noncommutative Domains -- Testing low degree trigonometric polynomials -- Property Testing Bounds for Linear and Quadratic Functions via Parity Decision Trees -- A Fast Branching Algorithm for Cluster Vertex Deletion -- Separation Logic with One Quantified Variable -- Notions of metric dimension of corona products -- On the Complexity of Computing Two Nonlinearity Measures -- Model Checking for String Problems -- Semiautomatic Structures -- The Query Complexity of Witness Finding -- Primal implication as encryption -- Processing Succinct Matrices and Vectors -- Constraint Satisfaction with Counting Quantifiers -- Dynamic Complexity of Planar 3-connected Graph Isomorphism -- Fast Approximate Computations with Cauchy Matrices, Polynomials and Rational Functions -- First-Order Logic on CPDA Graphs -- Recognizing two-sided contexts in cubic time -- A Parameterized Algorithm for Packing Overlapping Subgraphs -- Crossing-free spanning trees in visibility graphs of points between monotone polygonal obstacles -- The Connectivity of Boolean Satisfiability -- Randomized communication complexity of approximating Kolmogorov complexity -- Space Saving by Dynamic Algebraization.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.Theoretical Computer Science and General Issues,2512-2029 ;8476AlgorithmsComputer science—MathematicsDiscrete mathematicsComputer scienceNumerical analysisMachine theoryAlgorithmsDiscrete Mathematics in Computer ScienceTheory of ComputationNumerical AnalysisComputer Science Logic and Foundations of ProgrammingFormal Languages and Automata TheoryAlgorithms.Computer science—Mathematics.Discrete mathematics.Computer science.Numerical analysis.Machine theory.Algorithms.Discrete Mathematics in Computer Science.Theory of Computation.Numerical Analysis.Computer Science Logic and Foundations of Programming.Formal Languages and Automata Theory.004Hirsch Edward Aedthttp://id.loc.gov/vocabulary/relators/edtKuznetsov Sergei Oedthttp://id.loc.gov/vocabulary/relators/edtPin Jean-Éricedthttp://id.loc.gov/vocabulary/relators/edtVereshchagin Nikolayedthttp://id.loc.gov/vocabulary/relators/edtInternational Computer Science Symposium in RussiaMiAaPQMiAaPQMiAaPQBOOK9910484553203321Computer Science - Theory and Applications2889860UNINA