000 04617nam a22003975i 4500
001 295304
003 MX-SnUAN
005 20160429155222.0
007 cr nn 008mamaa
008 150903s2005 gw | o |||| 0|eng d
020 _a9783540320241
_99783540320241
024 7 _a10.1007/11560586
_2doi
035 _avtls000348134
039 9 _a201509030741
_bVLOAD
_c201404121050
_dVLOAD
_c201404090827
_dVLOAD
_y201402071020
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA75.5-76.95
100 1 _aCoppo, Mario.
_eeditor.
_9329617
245 1 0 _aTheoretical Computer Science :
_b9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005. Proceedings /
_cedited by Mario Coppo, Elena Lodi, G. Michele Pinna.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2005.
300 _axI, 411 páginas Also available online.
_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 ;
_v3701
500 _aSpringer eBooks
505 0 _aInvited Contributions -- Semantic Subtyping: Challenges, Perspectives, and Open Problems -- Biological Systems as Reactive Systems -- Mobile Agents Computing: Security Issues and Algorithmic Solutions -- Technical Contributions -- Efficient Algorithms for Detecting Regular Point Configurations -- Pickup and Delivery for Moving Objects on Broken Lines -- A Static Analysis of PKI-Based Systems -- Subtyping Object and Recursive Types Logically -- The Language ?: Circuits, Computations and Classical Logic -- Checking Risky Events Is Enough for Local Policies -- The Graph Rewriting Calculus: Confluence and Expressiveness -- Safe Object Composition in the Presence of Subtyping -- Reachability Analysis in Boxed Ambients -- Error Mining for Regular Expression Patterns -- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections -- Inapproximability Results for the Lateral Gene Transfer Problem -- Faster Deterministic Wakeup in Multiple Access Channels -- Weighted Coloring: Further Complexity and Approximability Results -- Quantum Algorithms for a Set of Group Theoretic Problems -- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs -- A Polymerase Based Algorithm for SAT -- Laxity Helps in Broadcast Scheduling -- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory -- Synthesis from Temporal Specifications Using Preferred Answer Set Programming -- Model Checking Strategic Abilities of Agents Under Incomplete Information -- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error -- A Theoretical Analysis of Alignment and Edit Problems for Trees -- A Complete Formulation of Generalized Affine Equivalence -- A New Combinatorial Approach to Sequence Comparison -- A Typed Assembly Language for Non-interference -- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems -- A Typed Semantics of Higher-Order Store and Subtyping -- Two Variables Are Not Enough.
520 _aThis book constitutes the refereed proceedings of the 9th International Conference on Theoretical Computer Science, ICTCS 2005, held at the Certosa di Pontignano, Siena, Italy, in October 2005. The 29 revised full papers presented together with an invited paper and abstracts of 2 invited talks were carefully reviewed and selected from 83 submissions. The papers address all current issues in theoretical computer science and focus especially on analysis and design of algorithms, computability, computational complexity, cryptography, formal languages and automata, foundations of programming languages and program analysis, natural computing paradigms (quantum computing, bioinformatics), program specification and verification, term rewriting, theory of logical design and layout, type theory, security, and symbolic and algebraic computation.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aLodi, Elena.
_eeditor.
_9329618
700 1 _aPinna, G. Michele.
_eeditor.
_9329619
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9783540291060
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/11560586
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c295304
_d295304