Theoretical Computer Science [electronic resource] :9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005. Proceedings /
Contributor(s): Coppo, Mario [editor.] | Lodi, Elena [editor.] | Pinna, G. Michele [editor.] | SpringerLink (Online service).Material type: BookSeries: Lecture Notes in Computer Science: 3701Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2005.Description: XI, 411 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783540320241.Subject(s): Computer science | Data structures (Computer science) | Computers | Algorithms | Computer logic | Mathematical logic | Computer Science | Theory of Computation | Computation by Abstract Devices | Data Structures | Algorithm Analysis and Problem Complexity | Logics and Meanings of Programs | Mathematical Logic and Formal LanguagesOnline resources: Click here to access online
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.