000 05270nam a22005175i 4500
001 u374423
003 SIRSI
005 20160812084234.0
007 cr nn 008mamaa
008 100612s2010 gw | s |||| 0|eng d
020 _a9783642131820
_9978-3-642-13182-0
040 _cMX-MeUAM
050 4 _aQA76.9.A43
082 0 4 _a005.1
_223
100 1 _aAblayev, Farid.
_eeditor.
245 1 0 _aComputer Science – Theory and Applications
_h[recurso electrónico] :
_b5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010. Proceedings /
_cedited by Farid Ablayev, Ernst W. Mayr.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXI, 397p. 49 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6072
505 0 _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.
520 _aThe 5th International Computer Science Symposium in Russia (CSR 2010) was held June 16–20, 2010 in Kazan, Russia, hosted by the Institute of Informatics of the Tatarstan Academy of Sciences and the Kazan State University. It was the?fth eventinthe seriesofregularinternationalmeetings,followingCSR2006 in St. Petersburg, CSR 2007 in Ekaterinburg, CSR 2008 in Moscow, and CSR 2009 in Novosibirsk. The opening lecture was given by Alexander Razborov, and seven more invited plenary lectures were given by Susanne Albers, Fedor Fomin, Juraj Hromkovi? c,RichardJozsa,PrabhakarRaghavan,Miklos Santha,and Uwe Scho- ¨ ning. This volume contains all the accepted papers and, at varying detail, the abstracts or extended abstracts of the invited talks. The scope of the proposed topics for the symposium was quite broad and covered basically all areas of the foundationsof(meaning:theoretical)computerscience.Unlikeinpreviousyears, no special application track was scheduled. We received 62 valid submissions in total, and out of these the Program Committee selected 30 for acceptance.
650 0 _aComputer science.
650 0 _aComputer software.
650 0 _aLogic design.
650 0 _aComputational complexity.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aLogics and Meanings of Programs.
650 2 4 _aMathematical Logic and Formal Languages.
650 2 4 _aDiscrete Mathematics in Computer Science.
650 2 4 _aComputation by Abstract Devices.
650 2 4 _aMathematics of Computing.
700 1 _aMayr, Ernst W.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642131813
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6072
856 4 0 _zLibro electrónico
_uhttp://148.231.10.114:2048/login?url=http://link.springer.com/book/10.1007/978-3-642-13182-0
596 _a19
942 _cLIBRO_ELEC
999 _c202303
_d202303