LEADER 05581nam 22007815 450 001 9910483557703321 005 20230223090519.0 010 $a3-642-38536-2 024 7 $a10.1007/978-3-642-38536-0 035 $a(CKB)2560000000105646 035 $a(Springer)9783642385360 035 $a(MH)013717684-8 035 $a(SSID)ssj0001071233 035 $a(PQKBManifestationID)11600063 035 $a(PQKBTitleCode)TC0001071233 035 $a(PQKBWorkID)11113917 035 $a(PQKB)11691349 035 $a(DE-He213)978-3-642-38536-0 035 $a(MiAaPQ)EBC3093088 035 $a(PPN)17049229X 035 $a(EXLCZ)992560000000105646 100 $a20130604d2013 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science - Theory and Applications $e8th International Computer Science Symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25-29, 2013, Proceedings /$fedited by Andrei A. Bulatov, Arseny M. Shur 205 $a1st ed. 2013. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2013. 215 $a1 online resource (XII, 445 p. 55 illus.)$cdigital 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7913 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-38535-4 327 $aThe Lovasz Local Lemma ? A Survey -- An Improved Knapsack Solver for Column Generation -- QuickHeapsort: Modifications and Improved Analysis -- Alphabetic Minimax Trees in Linear Time -- Decidability and Enumeration for Automatic Sequences: A Survey -- Walking on Data Words -- Careful Synchronization of Partial Automata with Restricted Alphabets -- Random Generation of Deterministic Acyclic Automata Using the Recursive Method -- Boolean Language Operations on Nondeterministic Automata with a Pushdown of Constant Height -- A Short Tutorial on Order-Invariant First-Order Logic -- Exponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams -- Parameterized Resolution with Bounded Conjunction -- Lower and Upper Bounds for the Length of Joins in the Lambek Calculus -- Graph Expansion, Tseitin Formulas and Resolution Proofs for CSP -- Towards NEXP versus BPP? -- Information Lower Bounds via Self-reducibility -- On the Encoding Invariance of Polynomial Time Computable Distribution Ensembles -- Improving on Gutfreund, Shaltiel, and Ta-Shma?s Paper ?If NP Languages Are Hard on the Worst-Case, Then It Is Easy to Find Their Hard Instances? -- Amortized Communication Complexity of an Equality Predicate -- On Coloring of Sparse Graphs -- On Recognizing Words That Are Squares for the Shuffle Product -- Cyclic Shift on Prefix-Free Languages -- Weak Abelian Periodicity of Infinite Words -- Universality of Regular Realizability Problems -- Potential Functions in Strategic Games -- The Probabilistic Min Dominating Set Problem -- Dichotomy of the H-Quasi-Cover Problem -- QCSP on Partially Reflexive Cycles ? The Wavy Line of Tractability -- Quantum Alternation -- Real Numbers, Chaos, and the Principle of a Bounded Density of Information -- Random Selection in Few Rounds -- One-Counter Verifiers for Decidable Languages -- More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding -- Composition with Algebra at the Background -- Model-Checking Bounded Multi-Pushdown Systems -- Multi-weighted Automata and MSO Logic -- Overlapping Tile Automata. 330 $aThis book constitutes the proceedings of the 8th International Computer Science Symposium in Russia, CSR 2013, held in Ekaterinburg, Russia, in June 2013. The 29 full papers presented in this volume were carefully reviewed and selected from 52 submissions. In addition the book contains 8 invited lectures. The papers are organized in topical sections on: algorithms; automata; logic and proof complexity; complexity; words and languages; and logic and automata. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v7913 606 $aAlgorithms 606 $aComputer science 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aMachine theory 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aTheory of Computation 606 $aDiscrete Mathematics in Computer Science 606 $aFormal Languages and Automata Theory 615 0$aAlgorithms. 615 0$aComputer science. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 0$aMachine theory. 615 14$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aTheory of Computation. 615 24$aDiscrete Mathematics in Computer Science. 615 24$aFormal Languages and Automata Theory. 676 $a004.0151 702 $aBulatov$b Andrei A$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aShur$b Arseny M$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483557703321 996 $aComputer Science - Theory and Applications$92889860 997 $aUNINA 999 $aThis Record contains information from the Harvard Library Bibliographic Dataset, which is provided by the Harvard Library under its Bibliographic Dataset Use Terms and includes data made available by, among others the Library of Congress