LEADER 01208nam a2200253 i 4500 001 991001867859707536 008 121029s2008 sz a b 101 0 fre c 020 $a9782870192962 035 $ab14083486-39ule_inst 040 $aBiblioteca Interfacoltà$bita 082 04$a034.109033 245 02$aL'encyclopedysme au XVIIIe siècle :$bactes du Colloque organisé par le Groupe d'étude du XVIIIe siècle de l'Universié de Liège (Liège, 30-31 octobre 2006) /$cedités par Françoise Tilkin 260 $aGeneve :$bDroz,$c2008 300 $a358, 15 p. :$bill. ;$c24 cm. 440 0$aBibliothèque de la Faculté de philosophie et lettres de l'Université de Liège ;$v296 504 $aIncludes bibliographical references and index. 650 4$aEnciclopedismo$zFrancia$ySec. 18.$xCongressi 700 1 $aTilkin, Françoise$eauthor$4http://id.loc.gov/vocabulary/relators/aut$0732229 907 $a.b14083486$b02-04-14$c29-10-12 912 $a991001867859707536 945 $aLE002 034.1 ENC$g1$i2002000899392$lle002$oe$pE0.00$q-$rl$s- $t0$u0$v0$w0$x0$y.i15451574$z29-10-12 996 $aEncyclopedysme au XVIIIe siècle$91442619 997 $aUNISALENTO 998 $ale002$b29-10-12$cm$da $e-$ffre$gsz $h2$i0 LEADER 06089nam 22008055 450 001 9910483768903321 005 20251226202649.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(BIP)30771385 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 $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 08$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. 330 $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. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6072 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science$xMathematics 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$xMathematics. 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 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