Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings by Mario CoppoTheoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings by Mario Coppo

Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005…

byMario CoppoEditorElena Lodi, G. Michele Pinna

Paperback | September 28, 2005

Pricing and Purchase Info

$136.79 online 
$164.50 list price save 16%
Earn 684 plum® points

Prices and offers may vary in store

Quantity:

In stock online

Ships free on orders over $25

Not available in stores

about

This 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.
Title:Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005…Format:PaperbackDimensions:411 pages, 23.5 × 15.5 × 0.01 inPublished:September 28, 2005Publisher:Springer-Verlag/Sci-Tech/TradeLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:3540291067

ISBN - 13:9783540291060

Look for similar items by category:

Reviews

Table of Contents

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.