LEADER 00833nam a22002291i 4500 001 991003574399707536 005 20040510102609.0 008 040802s1943 fr |||||||||||||||||frm 035 $ab1309466x-39ule_inst 035 $aARCHE-104727$9ExL 040 $aBiblioteca Interfacoltà$bita$cA.t.i. Arché s.c.r.l. Pandora Sicilia s.r.l. 082 04$a841 100 1 $aScève, Maurice$0395976 245 10$aDelie :$bobject de plus haulte vertu /$cMaurice Sceve 260 $aParis :$bTallone,$c1943 300 $a1 v. ;$c26 cm 907 $a.b1309466x$b02-04-14$c05-08-04 912 $a991003574399707536 945 $aLE002 Fondo Giudici L 1532$g1$i2002000349200$lle002$nC. 1$o-$pE0.00$q-$rn$so $t0$u0$v0$w0$x0$y.i13728179$z05-08-04 996 $aDelie$9203801 997 $aUNISALENTO 998 $ale002$b05-08-04$cm$da $e-$ffrm$gfr $h0$i1 LEADER 07077nam 22007455 450 001 9910484969803321 005 20251226202610.0 010 $a3-642-03816-6 024 7 $a10.1007/978-3-642-03816-7 035 $a(CKB)1000000000772886 035 $a(SSID)ssj0000318810 035 $a(PQKBManifestationID)11263369 035 $a(PQKBTitleCode)TC0000318810 035 $a(PQKBWorkID)10311285 035 $a(PQKB)10069496 035 $a(DE-He213)978-3-642-03816-7 035 $a(MiAaPQ)EBC3064463 035 $a(PPN)139951105 035 $a(BIP)27391558 035 $a(EXLCZ)991000000000772886 100 $a20100301d2009 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aMathematical Foundations of Computer Science 2009 $e34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009, Proceedings /$fedited by Rastislav Královic, Damian Niwinski 205 $a1st ed. 2009. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2009. 215 $a1 online resource (XV, 760 p.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5734 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-642-03815-8 327 $aInvited Papers -- Four Subareas of the Theory of Constraints, and Their Links -- Synchronization of Regular Automata -- Stochastic Process Creation -- Stochastic Games with Finitary Objectives -- Stochastic Data Streams -- Recent Advances in Population Protocols -- How to Sort a Train -- Contributed Papers -- Arithmetic Circuits, Monomial Algebras and Finite Automata -- An Improved Approximation Bound for Spanning Star Forest and Color Saving -- Energy-Efficient Communication in Multi-interface Wireless Networks -- Private Capacities in Mechanism Design -- Towards a Dichotomy of Finding Possible Winners in Elections Based on Scoring Rules -- Sampling Edge Covers in 3-Regular Graphs -- Balanced Paths in Colored Graphs -- Few Product Gates But Many Zeros -- Branching Programs for Tree Evaluation -- A Dichotomy Theorem for Polynomial Evaluation -- DP-Complete Problems Derived from Extremal NP-Complete Properties -- The Synchronization Problem for Locally Strongly Transitive Automata -- Constructing Brambles -- Self-indexed Text Compression Using Straight-Line Programs -- Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants -- Parameterized Complexity Classes under Logical Reductions -- The Communication Complexity of Non-signaling Distributions -- How to Use Spanning Trees to Navigate in Graphs -- Representing Groups on Graphs -- Admissible Strategies in Infinite Games over Graphs -- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems -- Future-Looking Logics on Data Words and Trees -- A By-Level Analysis of Multiplicative Exponential Linear Logic -- Hyper-minimisation Made Efficient -- Regular Expressions with Counting: Weak versus Strong Determinism -- Choosability of P 5-Free Graphs -- Time-Bounded Kolmogorov Complexity and Solovay Functions -- The Longest Path Problem Is Polynomial on Interval Graphs -- Synthesis for Structure Rewriting Systems -- On the Hybrid Extension of CTL and CTL?+? -- Bounds on Non-surjective Cellular Automata -- FO Model Checking on Nested Pushdown Trees -- The Prismoid of Resources -- A Dynamic Algorithm for Reachability Games Played on Trees -- An Algebraic Characterization of Semirings for Which the Support of Every Recognizable Series Is Recognizable -- Graph Decomposition for Improving Memoryless Periodic Exploration -- On FO 2 Quantifier Alternation over Words -- On the Recognizability of Self-generating Sets -- The Isomorphism Problem for k-Trees Is Complete for Logspace -- Snake-Deterministic Tiling Systems -- Query Automata for Nested Words -- A General Class of Models of -- The Complexity of Satisfiability for Fragments of Hybrid Logic?Part I -- Colouring Non-sparse Random Intersection Graphs -- On the Structure of Optimal Greedy Computation (for Job Scheduling) -- A Probabilistic PTAS for Shortest Common Superstring -- The Cost of Stability in Network Flow Games -- (Un)Decidability of Injectivity and Surjectivity in One-Dimensional Sand Automata -- Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm -- From Parity and Payoff Games to Linear Programming -- Partial Randomness and Dimension of Recursively Enumerable Reals -- Partial Solution and Entropy -- On Pebble Automata for Data Languages with Decidable Emptiness Problem -- Size and Energy of Threshold Circuits Computing Mod Functions -- Points on Computable Curves of Computable Lengths -- The Expressive Power of Binary Submodular Functions. 330 $aThe 34th International Symposium on Mathematical Foundations of Computer Science, MFCS2009,washeld in Novy ´ Smokovec,High Tatras(Slovakia)during August 24-28, 2009. This volume contains 7 invited and 56 contributed papers presented at the symposium. The contributed papers were selected by the P- gram Committee out of a total of 148 submissions. MFCS 2009 was organized by the Slovak Society for Computer Science and the Faculty of Mathematics, Physics and Informatics of the Comenius Univ- sity in Bratislava. It wassupported by the EuropeanAssociation for Theoretical Computer Science. We acknowledge with gratitude the support of all these - stitutions. The series of MFCS symposia has a well-established tradition dating back to 1972. The aim is to encourage high-quality research in all branches of th- retical computer science, and to bring together researchers who do not usually meet at specialized conferences. The symposium is organized on a rotating - sis in Poland, Czech Republic, and Slovakia. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v5734 606 $aComputer science 606 $aAlgorithms 606 $aMachine theory 606 $aComputer science$xMathematics 606 $aTheory of Computation 606 $aAlgorithms 606 $aComputer Science Logic and Foundations of Programming 606 $aFormal Languages and Automata Theory 606 $aMathematics of Computing 615 0$aComputer science. 615 0$aAlgorithms. 615 0$aMachine theory. 615 0$aComputer science$xMathematics. 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$aMathematics of Computing. 676 $a005.1 701 $aKralovic$b Rastislav$01762326 701 $aNiwinski$b Damian$067054 712 12$aSymposium on Mathematical Foundations of Computer Science (1972- ) 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484969803321 996 $aMathematical foundations of computer science 2009$94204933 997 $aUNINA