Theoretical Computer Science (eBook, PDF)
9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings
Redaktion: Coppo, Mario; Pinna, G. Michele; Lodi, Elena
40,95 €
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
40,95 €
Als Download kaufen
40,95 €
inkl. MwSt.
Sofort per Download lieferbar
Theoretical Computer Science (eBook, PDF)
9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings
Redaktion: Coppo, Mario; Pinna, G. Michele; Lodi, Elena
- Format: PDF
- Merkliste
- Auf die Merkliste
- Bewerten Bewerten
- Teilen
- Produkt teilen
- Produkterinnerung
- Produkterinnerung
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei
bücher.de, um das eBook-Abo tolino select nutzen zu können.
Hier können Sie sich einloggen
Hier können Sie sich einloggen
Sie sind bereits eingeloggt. Klicken Sie auf 2. tolino select Abo, um fortzufahren.
Bitte loggen Sie sich zunächst in Ihr Kundenkonto ein oder registrieren Sie sich bei bücher.de, um das eBook-Abo tolino select nutzen zu können.
- Geräte: PC
- ohne Kopierschutz
- eBook Hilfe
- Größe: 4.28MB
Produktdetails
- Verlag: Springer Berlin Heidelberg
- Seitenzahl: 411
- Erscheinungstermin: 21. Oktober 2005
- Englisch
- ISBN-13: 9783540320241
- Artikelnr.: 44122182
Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.
Mario Coppo, Università di Torino, Italy / Elena Lodi, Università di Siena, Italy / G. Michele Pinna, Università di Siena, Italy
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.- Two Variables Are Not Enough.
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.- Two Variables Are Not Enough.