LEADER 04400nam 2200625 a 450 001 9910483768903321 005 20200520144314.0 010 $a1-280-38667-3 010 $a9786613564597 010 $a3-642-13182-4 024 7 $a10.1007/978-3-642-13182-0 035 $a(CKB)2670000000028930 035 $a(SSID)ssj0000446370 035 $a(PQKBManifestationID)11282009 035 $a(PQKBTitleCode)TC0000446370 035 $a(PQKBWorkID)10506312 035 $a(PQKB)10058904 035 $a(DE-He213)978-3-642-13182-0 035 $a(MiAaPQ)EBC3065372 035 $a(PPN)149063423 035 $a(EXLCZ)992670000000028930 100 $a20100427d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer science - theory and applications $e5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings /$f[edited by] Farid Ablayev, Ernst W. Mayr 205 $a1st ed. 210 $aNew York $cSpringer$d2010 215 $a1 online resource (XI, 397 p. 49 illus.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6072 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13181-6 320 $aIncludes bibliographical references and index. 327 $aAlgorithms for Energy Management -- Sofic and Almost of Finite Type Tree-Shifts -- Proof-Based Design of Security Protocols -- Approximating the Minimum Length of Synchronizing Words Is Hard -- Realizability of Dynamic MSC Languages -- The max quasi-independent set Problem -- Equilibria in Quantitative Reachability Games -- Quotient Complexity of Closed Languages -- Right-Sequential Functions on Infinite Words -- Kernelization -- Zigzags in Turing Machines -- Frameworks for Logically Classifying Polynomial-Time Optimisation Problems -- Validating the Knuth-Morris-Pratt Failure Function, Fast and Online -- Identical Relations in Symmetric Groups and Separating Words with Reversible Automata -- Time Optimal d-List Colouring of a Graph -- The Cantor Space as a Generic Model of Topologically Presented Knowledge -- Algorithmics ? Is There Hope for a Unified Theory? -- Classifying Rankwidth k-DH-Graphs -- Lower Bound on Average-Case Complexity of Inversion of Goldreich?s Function by Drunken Backtracking Algorithms -- A SAT Based Effective Algorithm for the Directed Hamiltonian Cycle Problem -- Balancing Bounded Treewidth Circuits -- Obtaining Online Ecological Colourings by Generalizing First-Fit -- Classical Simulation and Complexity of Quantum Computations -- Prefix-Free and Prefix-Correct Complexities with Compound Conditions -- Monotone Complexity of a Pair -- Symbolic Models for Single-Conclusion Proof Logics -- Complexity of Problems Concerning Carefully Synchronizing Words for PFA and Directing Words for NFA -- Advancing Matrix Computations with Randomized Preprocessing -- Transfinite Sequences of Constructive Predicate Logics -- The Quantitative Analysis of User Behavior Online ? Data, Models and Algorithms -- A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem -- Complexity of Propositional Proofs -- Quantization of Random Walks: Search Algorithms and Hitting Time -- Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems -- Growth of Power-Free Languages over Large Alphabets -- A Partially Synchronizing Coloring -- An Encoding Invariant Version of Polynomial Time Computable Distributions -- Prehistoric Phenomena and Self-referentiality. 410 0$aLecture notes in computer science ;$v6072. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aCSR 2010 606 $aComputer science$vCongresses 606 $aComputer science$zRussia (Federation)$vCongresses 615 0$aComputer science 615 0$aComputer science 676 $a004.0151 701 $aAblayev$b Farid$01762384 701 $aMayr$b Ernst$064724 712 12$aInternational Computer Science Symposium in Russia 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910483768903321 996 $aComputer science - theory and applications$94202262 997 $aUNINA