000 06836nam a22003855i 4500
001 297497
003 MX-SnUAN
005 20160429155425.0
007 cr nn 008mamaa
008 150903s2007 gw | o |||| 0|eng d
020 _a9783540744566
_99783540744566
024 7 _a10.1007/9783540744566
_2doi
035 _avtls000350848
039 9 _a201509030501
_bVLOAD
_c201405060241
_dVLOAD
_y201402171107
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA76.9.A43
100 1 _aKu?era, Lud?k.
_eeditor.
_9333281
245 1 0 _aMathematical Foundations of Computer Science 2007 :
_b32nd International Symposium, MFCS 2007 ?eský Krumlov, Czech Republic, August 26-31, 2007 Proceedings /
_cedited by Lud?k Ku?era, Antonín Ku?era.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2007.
300 _axviii, 764 páginas
_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 ;
_v4708
500 _aSpringer eBooks
505 0 _aInvited Papers -- How To Be Fickle -- Finite Model Theory on Tame Classes of Structures -- Minimum Cycle Bases in Graphs Algorithms and Applications -- Hierarchies of Infinite Structures Generated by Pushdown Automata and Recursion Schemes -- Evolvability -- Random Graphs -- Expander Properties and the Cover Time of Random Intersection Graphs -- Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs -- Rewriting -- Transition Graphs of Rewriting Systems over Unranked Trees -- Rewriting Conjunctive Queries Determined by Views -- Approximation Algorithms -- Approximation Algorithms for the Maximum Internal Spanning Tree Problem -- New Approximability Results for 2-Dimensional Packing Problems -- On Approximation of Bookmark Assignments -- Automata and Circuits -- Height-Deterministic Pushdown Automata -- Minimizing Variants of Visibly Pushdown Automata -- Linear Circuits, Two-Variable Logic and Weakly Blocked Monoids -- Complexity I -- Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete -- NP by Means of Lifts and Shadows -- The Complexity of Solitaire -- Streams and Compression -- Adapting Parallel Algorithms to the W-Stream Model, with Applications to Graph Problems -- Space-Conscious Compression -- Graphs I -- Small Alliances in Graphs -- The Maximum Solution Problem on Graphs -- Iteration and Recursion -- What Are Iteration Theories? -- Properties Complementary to Program Self-reference -- Algorithms I -- Dobrushin Conditions for Systematic Scan with Block Dynamics -- On the Complexity of Computing Treelength -- On Time Lookahead Algorithms for the Online Data Acknowledgement Problem -- Automata -- Real Time Language Recognition on 2D Cellular Automata: Dealing with Non-convex Neighborhoods -- Towards a Rice Theorem on Traces of Cellular Automata -- Progresses in the Analysis of Stochastic 2D Cellular Automata: A Study of Asynchronous 2D Minority -- Complexity II -- Public Key Identification Based on the Equivalence of Quadratic Forms -- Reachability Problems in Quaternion Matrix and Rotation Semigroups -- VPSPACE and a Transfer Theorem over the Complex Field -- Protocols -- Efficient Provably-Secure Hierarchical Key Assignment Schemes -- Nearly Private Information Retrieval -- Graphs II -- Packing and Squeezing Subgraphs into Planar Graphs -- Dynamic Matchings in Convex Bipartite Graphs -- Networks -- Communication in Networks with Random Dependent Faults -- Optimal Gossiping in Directed Geometric Radio Networks in Presence of Dynamical Faults -- Algorithms II -- A Linear Time Algorithm for the k Maximal Sums Problem -- A Lower Bound of 1?+?? for Truthful Scheduling Mechanisms -- Analysis of Maximal Repetitions in Strings -- Languages -- Series-Parallel Languages on Scattered and Countable Posets -- Traces of Term-Automatic Graphs -- State Complexity of Basic Operations on Suffix-Free Regular Languages -- Graphs III -- Exact Algorithms for L(2,1)-Labeling of Graphs -- On (k,?)-Leaf Powers -- Quantum Computing -- An Improved Claw Finding Algorithm Using Quantum Walk -- Complexity Upper Bounds for Classical Locally Random Reductions Using a Quantum Computational Argument -- Isomorphism -- On the Complexity of Game Isomorphism -- Hardness Results for Tournament Isomorphism and Automorphism -- Relating Complete and Partial Solution for Problems Similar to Graph Automorphism -- Equilibria -- Well Supported Approximate Equilibria in Bimatrix Games: A Graph Theoretic Approach -- Selfish Load Balancing Under Partial Knowledge -- Extending the Notion of Rationality of Selfish Agents: Second Order Nash Equilibria -- Games -- Congestion Games with Player-Specific Constants -- Finding Patterns in Given Intervals -- The Power of Two Prices: Beyond Cross-Monotonicity -- Algebra and Strings -- Semisimple Algebras of Almost Minimal Rank over the Reals -- Structural Analysis of Gapped Motifs of a String -- Algorithms III -- Online and Offline Access to Short Lists -- Optimal Randomized Comparison Based Algorithms for Collision -- Randomized and Approximation Algorithms for Blue-Red Matching -- Words and Graphs -- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation -- Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances -- Shuffle Expressions and Words with Nested Data.
520 _aThis book constitutes the refereed proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007, held in Ceský Krumlov, Czech Republic, August 26-31, 2007. The 61 revised full papers presented together with the full papers or abstracts of 5 invited talks were carefully reviewed and selected from 167 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithms and data structures, to complexity, automata, semantics, logic, formal specifications, models of computation, concurrency theory, computational geometry, parallel and distributed computing, networks, bioinformatics, quantum computing, cryptography, knowledge-based systems, and artificial intelligence.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aKu?era, Antonín.
_eeditor.
_9333282
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540744559
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-3-540-74456-6
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c297497
_d297497