04400nam 2200625 a 450 991048376890332120200520144314.01-280-38667-397866135645973-642-13182-410.1007/978-3-642-13182-0(CKB)2670000000028930(SSID)ssj0000446370(PQKBManifestationID)11282009(PQKBTitleCode)TC0000446370(PQKBWorkID)10506312(PQKB)10058904(DE-He213)978-3-642-13182-0(MiAaPQ)EBC3065372(PPN)149063423(EXLCZ)99267000000002893020100427d2010 uy 0engurnn|008mamaatxtccrComputer science - theory and applications 5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010 : proceedings /[edited by] Farid Ablayev, Ernst W. Mayr1st ed.New York Springer20101 online resource (XI, 397 p. 49 illus.) Lecture notes in computer science,0302-9743 ;6072LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-642-13181-6 Includes bibliographical references and index.Algorithms 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.Lecture notes in computer science ;6072.LNCS sublibrary.SL 1,Theoretical computer science and general issues.CSR 2010Computer scienceCongressesComputer scienceRussia (Federation)CongressesComputer scienceComputer science004.0151Ablayev Farid1762384Mayr Ernst64724International Computer Science Symposium in RussiaMiAaPQMiAaPQMiAaPQBOOK9910483768903321Computer science - theory and applications4202262UNINA