000 06180nam a22003855i 4500
001 300302
003 MX-SnUAN
005 20160429155623.0
007 cr nn 008mamaa
008 150903s2009 gw | o |||| 0|eng d
020 _a9783642038167
_99783642038167
024 7 _a10.1007/9783642038167
_2doi
035 _avtls000353739
039 9 _a201509030520
_bVLOAD
_c201405060325
_dVLOAD
_y201402181000
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aKrálovi?, Rastislav.
_eeditor.
_9332288
245 1 0 _aMathematical Foundations of Computer Science 2009 :
_b34th International Symposium, MFCS 2009, Novy Smokovec, High Tatras, Slovakia, August 24-28, 2009. Proceedings /
_cedited by Rastislav Královi?, Damian Niwi?ski.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2009.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v5734
500 _aSpringer eBooks
505 0 _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.
520 _aThis book constitutes the refereed proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009, held in Novy Smokovec, High Tatras, Slovakia, in August 2009. The 56 revised full papers presented together with 7 invited lectures were carefully reviewed and selected from 148 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, including algorithmic game theory, algorithmic tearning theory, algorithms and data structures, automata, grammars and formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, cryptography and security, databases and knowledge-based systems, formal specifications and program development, foundations of computing, logic in computer science, mobile computing, models of computation, networks, parallel and distributed computing, quantum computing, semantics and verification of programs, theoretical issues in artificial intelligence.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aNiwi?ski, Damian.
_eeditor.
_9337613
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783642038150
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-642-03816-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c300302
_d300302