Skip to main content
  • Conference proceedings
  • © 2003

Theoretical Computer Science

8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings

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

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

Conference proceedings info: ICTCS 2003.

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 (30 papers)

  1. Front Matter

  2. Invited Talks

    1. Extreme Nash Equilibria

      • Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul Spirakis
      Pages 1-20
    2. Certification of Memory Usage

      • Martin Hofmann
      Pages 21-21
    3. On Programming Models for Mobility

      • Gérard Boudol
      Pages 22-22
  3. Program Design, Models and Analysis

    1. On the Computational Complexity of Cut-Elimination in Linear Logic

      • Harry G. Mairson, Kazushige Terui
      Pages 23-36
    2. Finite Horizon Analysis of Stochastic Systems with the Murφ Verifier

      • Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli
      Pages 58-71
    3. Towards Compact and Tractable Automaton-Based Representations of Time Granularities

      • Ugo Dal Lago, Angelo Montanari, Gabriele Puppis
      Pages 72-85
    4. Lower Bounds on the Size of Quantum Automata Accepting Unary Languages

      • Alberto Bertoni, Carlo Mereghetti, Beatrice Palano
      Pages 86-96
    5. Refined Effects for Unanticipated Object Re-classification: $\mathcal{F}ickle_{\rm 3}$

      • Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini
      Pages 97-110
  4. Algorithms and Complexity

    1. Cost Constrained Fixed Job Scheduling

      • Qiwei Huang, Errol Lloyd
      Pages 111-124
    2. Channel Assignment in Honeycomb Networks

      • Alan A. Bertossi, Cristina M. Pinotti, Romea Rizzi, Anil M. Shende
      Pages 150-162
    3. The Complexity of Checking Consistency of Pedigree Information and Related Problems

      • Luca Aceto, Jens A. Hansen, Anna Ingólfsdóttir, Jacob Johnsen, John Knudsen
      Pages 174-187
    4. On Clausal Equivalence and Hull Inclusion

      • K. Subramani
      Pages 188-201
  5. Semantics and Formal Languages

    1. Logical Semantics for the First Order ς-Calculus

      • Steffen van Bakel, Ugo de’Liguoro
      Pages 202-215
    2. Reasoning about Self and Others: Communicating Agents in a Modal Action Logic

      • Matteo Baldoni, Cristina Baroglio, Alberto Martelli, Viviana Patti
      Pages 228-241

Other Volumes

  1. Theoretical Computer Science

Keywords

  • Java
  • algorithms
  • automata
  • complexity
  • computer science
  • discrete mathematics
  • formal language
  • logic
  • mathematical foundations
  • mathematical logic
  • programming theory
  • theoretical computer science
  • theoretical informatics
  • theory of computing
  • verification
  • data structures
  • algorithm analysis and problem complexity

Editors and Affiliations

  • Dipartimento di Informatica e Applicazioni, Università degli Studi di Salerno, Fisciano, Italy

    Carlo Blundo

  • Department of Computer Science, University of Bologna,  

    Cosimo Laneve

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