LEADER 01265nam--2200385---4500 001 990000501830203316 005 20090331125132.0 010 $a0-19-520832-3 035 $a0050183 035 $aUSA010050183 035 $a(ALEPH)000050183USA01 035 $a0050183 100 $a20010611d--------km-y0ENGy0103----ba 101 $aeng 102 $aUS 200 1 $aChallenging the political order$enew social and political movements in wester democracies$fedited by Russel J. Dalton and Manfred Kuechler 210 $aNew York$cOxford$dOxford University press 215 $a1990$cXII, 329 p.$d24 cm 225 2 $aEurope and the international order 410 $12001$aEurope and the international order 606 0 $aMutamento sociale$yEuropa 676 $a303.484094 702 1$aDALTON,$bRussell J. 702 1$aKUECHLER,$bManfred 801 0$aIT$bsalbc$gISBD 912 $a990000501830203316 951 $a303.484 CHA 1 (ISP IV 582)$b12371 G$cISP IV$d00204442 959 $aBK 969 $aECO 979 $aPATTY$b90$c20010611$lUSA01$h1246 979 $c20020403$lUSA01$h1659 979 $aPATRY$b90$c20040406$lUSA01$h1635 979 $aRSIAV3$b90$c20090331$lUSA01$h1251 996 $aChallenging the political order$9887462 997 $aUNISA LEADER 05007nam 22007455 450 001 996465855203316 005 20230220232701.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 $a20100612d2010 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aComputer Science -- Theory and Applications$b[electronic resource] $e5th International Computer Science Symposium in Russia, CSR 2010, Kazan, Russia, June 16-20, 2010, Proceedings /$fedited by Farid M. Ablaev, Ernst W. Mayr 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XI, 397 p. 49 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6072 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$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6072 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science?Mathematics 606 $aDiscrete mathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aDiscrete Mathematics in Computer Science 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer science?Mathematics. 615 0$aDiscrete mathematics. 615 14$aTheory of Computation. 615 24$aAlgorithms. 615 24$aComputer Science Logic and Foundations of Programming. 615 24$aFormal Languages and Automata Theory. 615 24$aDiscrete Mathematics in Computer Science. 676 $a004.0151 702 $aAblaev$b Farid M$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aMayr$b Ernst W$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aInternational Computer Science Symposium in Russia 906 $aBOOK 912 $a996465855203316 996 $aComputer Science - Theory and Applications$92889860 997 $aUNISA