ShopSpell

Theoretical Computer Science: 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings [Paperback]

$42.99     $54.99   22% Off      (Free Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3540291067
  • ISBN-10:  3540291067
  • ISBN-13:  9783540291060
  • ISBN-13:  9783540291060
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  411
  • Pages:  411
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Apr-2005
  • Pub Date:  01-Apr-2005
  • SKU:  3540291067-11-SPRI
  • SKU:  3540291067-11-SPRI
  • Item ID: 105308225
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 5 business days
  • Delivery by: Nov 01 to Nov 03
  • Notes: Brand New Item. Not shipped to AK, HI, APO, FPO, AE.
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 SequenceComparison.- 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.-lsƒ
Add Review