Skip to main content
  • Conference proceedings
  • © 2005

Theoretical Computer Science

9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 3701)

Part of the book sub series: Theoretical Computer Science and General Issues (LNTCS)

Conference series link(s): ICTCS: Italian Conference on Theoretical Computer Science

Conference proceedings info: ICTCS 2005.

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

This is a preview of subscription content, access via your institution.

Table of contents (32 papers)

  1. Front Matter

  2. Technical Contributions

    1. Efficient Algorithms for Detecting Regular Point Configurations

      • Luzi Anderegg, Mark Cieliebak, Giuseppe Prencipe
      Pages 23-35
    2. Pickup and Delivery for Moving Objects on Broken Lines

      • Yuichi Asahiro, Eiji Miyano, Shinichi Shimoirisa
      Pages 36-50
    3. A Static Analysis of PKI-Based Systems

      • Benjamin Aziz, David Gray, Geoff Hamilton
      Pages 51-65
    4. Subtyping Object and Recursive Types Logically

      • Steffen van Bakel, Ugo de’Liguoro
      Pages 66-80
    5. The Language χ: Circuits, Computations and Classical Logic

      • Steffen van Bakel, Stéphane Lengrand, Pierre Lescanne
      Pages 81-96
    6. Checking Risky Events Is Enough for Local Policies

      • Massimo Bartoletti, Pierpaolo Degano, Gian Luigi Ferrari
      Pages 97-112
    7. Safe Object Composition in the Presence of Subtyping

      • Lorenzo Bettini, Viviana Bono, Silvia Likavec
      Pages 128-142
    8. Reachability Analysis in Boxed Ambients

      • Nadia Busi, Gianluigi Zavattaro
      Pages 143-159
    9. Error Mining for Regular Expression Patterns

      • Giuseppe Castagna, Dario Colazzo, Alain Frisch
      Pages 160-172
    10. Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections

      • Marie-Christine Costa, Fethi Jarray, Christophe Picouleau
      Pages 173-181
    11. Inapproximability Results for the Lateral Gene Transfer Problem

      • Bhaskar DasGupta, Sergio Ferrarini, Uthra Gopalakrishnan, Nisha Raj Paryani
      Pages 182-195
    12. Faster Deterministic Wakeup in Multiple Access Channels

      • Gianluca De Marco, Marco Pellegrini, Giovanni Sburlati
      Pages 196-204
    13. Weighted Coloring: Further Complexity and Approximability Results

      • Bruno Escoffier, Jérôme Monnot, Vangelis Th. Paschos
      Pages 205-214
    14. Quantum Algorithms for a Set of Group Theoretic Problems

      • Stephen A. Fenner, Yong Zhang
      Pages 215-227

Other Volumes

  1. Theoretical Computer Science

Keywords

  • Algorithms
  • Automat
  • algorithm
  • automata
  • bioinformatics
  • complexity
  • computer
  • computer science
  • formal language
  • formal languages
  • programming
  • programming language
  • term rewriting
  • verification
  • data structures
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Dipartimento di Informatica, Università di Torino,  

    Mario Coppo

  • Dipartimento di Scienze Matematiche e Informatiche, Università di Siena, Siena, Italy

    Elena Lodi

  • Dipartimento di Matematica e Informatica, Università di Cagliari

    G. Michele Pinna

Bibliographic Information

Buying options

eBook USD 39.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions