Theoretical Computer Science [[electronic resource] ] : 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings / / edited by Mario Coppo, Elena Lodi, G. Michele Pinna |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 |
Descrizione fisica | 1 online resource (XI, 411 p.) |
Disciplina | 004 |
Collana | Theoretical Computer Science and General Issues |
Soggetto topico |
Computer science
Artificial intelligence—Data processing Algorithms Machine theory Theory of Computation Data Science Computer Science Logic and Foundations of Programming Formal Languages and Automata Theory |
ISBN |
3-540-32024-5
3-540-29106-7 |
Classificazione | 54.10 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Record Nr. | UNISA-996465861903316 |
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2005 | ||
![]() | ||
Lo trovi qui: Univ. di Salerno | ||
|
Theoretical computer science : 9th Italian conference, ICTCS 2005, Siena, Italy, October 12-14, 2005 : proceedings / / Mario Coppo, Elena Lodi, G. Michele Pinna (eds.) |
Edizione | [1st ed. 2005.] |
Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2005 |
Descrizione fisica | 1 online resource (XI, 411 p.) |
Disciplina | 004 |
Altri autori (Persone) |
CoppoMario <1947->
LodiE (Elena) PinnaG. Michele |
Collana | Lecture notes in computer science |
Soggetto topico | Computer science |
ISBN |
3-540-32024-5
3-540-29106-7 |
Classificazione | 54.10 |
Formato | Materiale a stampa ![]() |
Livello bibliografico | Monografia |
Lingua di pubblicazione | eng |
Nota di contenuto | 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. |
Altri titoli varianti | ICTCS 2005 |
Record Nr. | UNINA-9910484051303321 |
Berlin ; ; New York, : Springer, c2005 | ||
![]() | ||
Lo trovi qui: Univ. Federico II | ||
|