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

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Coppo, Mario (Editor ), Lodi, Elena (Editor ), Pinna, G. Michele (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2005.
Edición:1st ed. 2005.
Colección:Theoretical Computer Science and General Issues, 3701
Temas:
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.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • 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.

Ejemplares similares