03978nam 2200589 a 450 991048405130332120200520144314.03-540-32024-53-540-29106-710.1007/11560586(CKB)1000000000213282(SSID)ssj0000320366(PQKBManifestationID)11233631(PQKBTitleCode)TC0000320366(PQKBWorkID)10249167(PQKB)11450672(DE-He213)978-3-540-32024-1(MiAaPQ)EBC3067727(PPN)123097819(EXLCZ)99100000000021328220060531d2005 uy 0engurnn|008mamaatxtccrTheoretical computer science 9th Italian conference, ICTCS 2005, Siena, Italy, October 12-14, 2005 : proceedings /Mario Coppo, Elena Lodi, G. Michele Pinna (eds.)1st ed. 2005.Berlin ;New York Springerc20051 online resource (XI, 411 p.) Lecture notes in computer science,0302-9743 ;3701"9th Italian Conference on Theoretical Computer Science"--Pref.Printed edition: 9783540291060 Includes bibliographical references and index.Invited 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.Lecture notes in computer science ;3701.ICTCS 2005Computer scienceCongressesComputer science00454.10bclCoppo Mario1947-94608Lodi E(Elena)20389Pinna G. Michele1757741Italian Conference on Theoretical Computer ScienceMiAaPQMiAaPQMiAaPQBOOK9910484051303321Theoretical computer science4195691UNINA