• The Complexity of Checking Consistency of Pedigree Information and Related Problems, Luca Aceto (Department of Computer Science, Aalborg University), Jens Hansen (Department of Computer Science, Aalborg University) Anna Ingolfsdottir (Department of Computer Science, Aalborg University and deCODE Genetics), Jacob Johnsen (Department of Computer Science, Aalborg University) and John Knudsen (Department of Computer Science, Aalborg University)
  • Cost Constrained Fixed Job Scheduling , Qiwei Huang (UTStarcom) and Errol Lloyd (University of Delaware)
  • A work-optimal coarse-grained parallel algorithm for Lexicographically First Maximal Independent Set, Jan Arne Telle (Dept informatics, Univ Bergen) and Jens Gustedt (LORIA/INRIA)
  • Aspects of pseudorandomness in nonlinear generators of binary sequences, Amparo FUSTER-SABATER (Instituto Fisica Aplicada (C.S.I.C.))
  • Anonymous Group Communication in Mobile Networks, Stelvio Cimato, Paolo D'Arco and Ivan Visconti (Dipartimento di Inf. e Applic. - Universita' di Salerno)
  • Logical Semantics for the First Order Sigma-Calculus, Steffen van Bakel (Department of Computing, Imperial College) and Ugo de'Liguoro (Dipartimento di Informatica, Universita' di Torino)
  • Channel Assignment in Honeycomb Networks, Alan A. Bertossi (Department of Computer Science, University of Bologna,Bologna, Italy), Cristina M. Pinotti, Romeo Rizzi (Dept. of Computer Science and Telecommunications, University ofTrento, Trento, Italy) and Anil M. Shende (Department of Computer Science, Roanoke College, Salem, VA, USA)
  • Reasoning about self and others: communicating agents in a modal action logic, Matteo Baldoni, Cristina Baroglio, Alberto Martelli and Viviana Patti (Dipartimento Informatica - Universita` di Torino)
  • Information Flow Security and Recursive Systems, Annalisa Bossi, Damiano Macedonio, Carla Piazza and Sabina Rossi (Universita' Ca' Foscari di Venezia)
  • Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks (Extended Abstract), Tiziana Calamoneri (Univ. of Rome )
  • Decidability properties of recursive types, Felice CerdoneCoppo (DISCo - Universita' di Milano-Bicocca) and Mario Coppo (Diaprtimento di Informatica - Universita' di Torino)
  • Towards Compact and Tractable Automaton-based Representations of Time Granularities, Ugo Dal Lago (Università di Bologna), Angelo Montanari and Gabriele Puppis (Università di Udine)
  • An Information-Theoretic Approach to the Access Control Problem, Anna Lisa Ferrara and Barbara Masucci (Dipartimento di Informatica ed Applicazioni, Universita' di Salerno)
  • Algebraic theories for contextual pre-nets, Roberto Bruni (Computer Science Department, University of Pisa, Italy), Jose' Meseguer (Computer Science Department, University of Illinois at Urbana-Champaign, IL, USA), Ugo Montanari (Computer Science Department, University of Pisa, Italy) and Vladimiro Sassone (COGS, University of Sussex, Brighton, UK)
  • On the Computational Complexity of Cut-Elimination in Linear Logic , Harry Mairson (Computer Science Department, Brandeis University) and Kazushige Terui (National Institute of Informatics)
  • Refined effects for unanticipated object re-classification: Fickle3, Ferruccio Damiani (Dipartimento di Informatica - Universita' di Torino) and Paola Giannini (Dipartimento di Informatica - Universita' del Piemonte Orientale)
  • Lower bounds on the size of quantum automata accepting unary languages, Alberto Bertoni, Carlo Mereghetti and Beatrice Palano (Dipartimento di Scienze dell'Informazione - Universita' degli Studi di Milano)
  • An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality, Alessandro Ferrante (Dipartimento di Informatica ed Applicazioni - Università degli Studi di Salerno ) and Mimmo Parente (Dipartimento di Informatica ed Applicazioni - Università degli Studi di Salerno)
  • On the Expressive Power of Light Affine Logic, Ugo Dal Lago (Dipartimento di Scienze Dell'Informazione, Università di Bologna)
  • A Coalgebraic Description of Web Interaction, Daniela Cancila and Furio Honsell (DiMI. Universita' degli Studi di Udine)
  • Compositional Verification of Secure Streaming Data: a Case Study with EMSS, Fabio Martinelli (IIT-CNR ), Marinella Petrocchi and Anna Vaccarelli (IIT-CNR)
  • A Calculus for Dynamic Linking, Davide Ancona, Sonia Fagorzi and Elena Zucca (DISI - Universita` di Genova)
  • Towards a Smart Compilation Manager for Java, Giovanni Lagorio (DISI)
  • A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics., Claudio Sacerdoti Coen (Department of Computer Science, University of Bologna)
  • Security-aware program transformations, Massimo Bartoletti, Pierpaolo Degano and Gian Luigi Ferrari (Dipartimento di Informatica, Universita' di Pisa)
  • On Clausal Equivalence and Hull Inclusion, K. Subramani (West Virginia University)
  • Finite Horizon Analysis of Stochastic Systems with Murphi Verifier, Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti (Universita' di L'Aquila), Enrico Tronci and Marisa Venturini-Zilli (Universita' di Roma)