LEADER 05080nam 22008415 450 001 9910484553203321 005 20230221004124.0 010 $a3-319-06686-2 024 7 $a10.1007/978-3-319-06686-8 035 $a(CKB)3710000000143817 035 $a(SSID)ssj0001275073 035 $a(PQKBManifestationID)11810318 035 $a(PQKBTitleCode)TC0001275073 035 $a(PQKBWorkID)11334217 035 $a(PQKB)11550526 035 $a(DE-He213)978-3-319-06686-8 035 $a(MiAaPQ)EBC3093137 035 $a(PPN)179765973 035 $a(EXLCZ)993710000000143817 100 $a20140602d2014 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science - Theory and Applications $e9th International Computer Science Symposium in Russia, CSR 2014, Moscow, Russia, June 7-11, 2014. Proceedings /$fedited by Edward Hirsch, Sergei O. Kuznetsov, Jean-Éric Pin, Nikolay Vereshchagin 205 $a1st ed. 2014. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2014. 215 $a1 online resource (XX, 389 p. 39 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8476 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-319-06685-4 320 $aIncludes bibliographical references and author index. 327 $aFinding 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. 330 $aThis 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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v8476 606 $aAlgorithms 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aComputer science 606 $aNumerical analysis 606 $aMachine theory 606 $aAlgorithms 606 $aDiscrete Mathematics in Computer Science 606 $aTheory of Computation 606 $aNumerical Analysis 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 615 0$aAlgorithms. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aComputer science. 615 0$aNumerical analysis. 615 0$aMachine theory. 615 14$aAlgorithms. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aTheory of Computation. 615 24$aNumerical Analysis. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 676 $a004 702 $aHirsch$b Edward A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aKuznetsov$b Sergei O$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aPin$b Jean-Éric$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVereshchagin$b Nikolay$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Computer Science Symposium in Russia 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484553203321 996 $aComputer Science - Theory and Applications$92889860 997 $aUNINA