9. ICTCS 2005: Siena, Italy

Invited Contributions

• Giuseppe Castagna:
  Semantic Subtyping: Challenges, Perspectives, and Open Problems. 1-20
  
• Luca Cardelli:
  Biological Systems as Reactive Systems. 21
  
• Nicola Santoro:
  Mobile Agents Computing: Security Issues and Algorithmic Solutions. 22
  

Technical Contributions

• Luzi Anderegg, Mark Cieliebak, Giuseppe Prencipe:
  Efficient Algorithms for Detecting Regular Point Configurations. 23-35
  
• Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa:
  Pickup and Delivery for Moving Objects on Broken Lines. 36-50
  
• Benjamin Aziz, David Gray, Geoff W. Hamilton:
  A Static Analysis of PKI-Based Systems. 51-65
  
• Steffen van Bakel, Ugo de'Liguoro:
  Subtyping Object and Recursive Types Logically. 66-80
  
• Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne:
  The Language chi: Circuits, Computations and Classical Logic. 81-96
  
• Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari:
  Checking Risky Events Is Enough for Local Policies. 97-112
  
• Clara Bertolissi:
  The Graph Rewriting Calculus: Confluence and Expressiveness. 113-127
  
• Lorenzo Bettini, Viviana Bono, Silvia Likavec:
  Safe Object Composition in the Presence of Subtyping. 128-142
  
• Nadia Busi, Gianluigi Zavattaro:
  Reachability Analysis in Boxed Ambients. 143-159
  
• Giuseppe Castagna, Dario Colazzo, Alain Frisch:
  Error Mining for Regular Expression Patterns. 160-172
  
• Marie-Christine Costa, Fethi Jarray, Christophe Picouleau:
  Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections. 173-181
  
• Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani:
  Inapproximability Results for the Lateral Gene Transfer Problem. 182-195
  
• Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati:
  Faster Deterministic Wakeup in Multiple Access Channels. 196-204
  
• Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos:
  Weighted Coloring: Further Complexity and Approximability Results. 205-214
  
• Stephen A. Fenner, Yong Zhang:
  Quantum Algorithms for a Set of Group Theoretic Problems. 215-227
  
• Jirí Fiala, Jan Kratochvíl:
  On the Computational Complexity of the L_{(2, 1)}-Labeling Problem for Regular Graphs. 228-236
  
• Giuditta Franco:
  A Polymerase Based Algorithm for SAT. 237-250
  
• Stanley P. Y. Fung, Francis Y. L. Chin, Chung Keung Poon:
  Laxity Helps in Broadcast Scheduling. 251-264
  
• Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena:
  Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. 265-279
  
• Stijn Heymans, Davy Van Nieuwenborgh, Dirk Vermeir:
  Synthesis from Temporal Specifications Using Preferred Answer Set Programming. 280-294
  
• Wojciech Jamroga, Jürgen Dix:
  Model Checking Strategic Abilities of Agents Under Incomplete Information. 295-308
  
• Tsvi Kopelowitz, Ely Porat:
  Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error. 309-322
  
• Tetsuji Kuboyama, Kilho Shin, Tetsuhiro Miyahara, Hiroshi Yasuda:
  A Theoretical Analysis of Alignment and Edit Problems for Trees. 323-337
  
• Marco Macchetti, Mario Caironi, Luca Breveglieri, Alessandra Cherubini:
  A Complete Formulation of Generalized Affine Equivalence. 338-347
  
• Sabrina Mantaci, Antonio Restivo, Giovanna Rosone, Marinella Sciortino:
  A New Combinatorial Approach to Sequence Comparison. 348-359
  
• Ricardo Medel, Adriana B. Compagnoni, Eduardo Bonelli:
  A Typed Assembly Language for Non-interference. 360-374
  
• Venkatesh Raman, Saket Saurabh, Somnath Sikdar:
  Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems. 375-389
  
• Jan Schwinghammer:
  A Typed Semantics of Higher-Order Store and Subtyping. 390-405
  
• Richard Statman:
  Two Variables Are Not Enough. 406-409