default search action
8th ICTCS 2003: Bertinoro, Italy
- Carlo Blundo, Cosimo Laneve:
Theoretical Computer Science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings. Lecture Notes in Computer Science 2841, Springer 2003, ISBN 3-540-20216-1
Invited Talks
- Martin Gairing, Thomas Lücking, Marios Mavronicolas, Burkhard Monien, Paul G. Spirakis:
Extreme Nash Equilibria. 1-20 - Martin Hofmann:
Certification of Memory Usage. 21 - Gérard Boudol:
On Programming Models for Mobility. 22
Program Design, Models and Analysis
- Harry G. Mairson, Kazushige Terui:
On the Computational Complexity of Cut-Elimination in Linear Logic. 23-36 - Claudio Sacerdoti Coen:
A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics. 37-57 - Giuseppe Della Penna, Benedetto Intrigila, Igor Melatti, Enrico Tronci, Marisa Venturini Zilli:
Finite Horizon Analysis of Stochastic Systems with the Mur varphi Verifier. 58-71 - Ugo Dal Lago, Angelo Montanari, Gabriele Puppis:
Towards Compact and Tractable Automaten-Based Representations of Time Granularities. 72-85 - Alberto Bertoni, Carlo Mereghetti, Beatrice Palano:
Lower Bounds on the Size of Quantum Automata Accepting Unary Languages. 86-96 - Ferruccio Damiani, Sophia Drossopoulou, Paola Giannini:
Refined Effects for Unanticipated Object Re-classification: Fickle3. 97-110
Algorithms and Complexity
- Qiwei Huang, Errol L. Lloyd:
Cost Constrained Fixed Job Scheduling. 111-124 - Jens Gustedt, Jan Arne Telle:
A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set. 125-136 - Alessandro Ferrante, Mimmo Parente:
An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality. 137-149 - Alan A. Bertossi, Maria Cristina Pinotti, Romeo Rizzi, Anil M. Shende:
Channel Assignment in Honeycomb Networks. 150-162 - Tiziana Calamoneri:
Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks. 163-173 - Luca Aceto, Jens A. Hansen, Anna Ingólfsdóttir, Jacob Johnsen, John Knudsen:
The Complexity of Checking Consistency of Pedigree Information and Related Problems. 174-187 - K. Subramani:
On Clausal Equivalence and Hull Inclusion. 188-201
Semantics and Formal Languages
- Steffen van Bakel, Ugo de'Liguoro:
Logical Semantics for the First Order varsigma-Calculus. 202-215 - Ugo Dal Lago:
On the Expressive Power of Light Affine Logic. 216-227 - Matteo Baldoni, Cristina Baroglio, Alberto Martelli, Viviana Patti:
Reasoning about Self and Others: Communicating Agents in a Model Action Logic. 228-241 - Felice Cardone, Mario Coppo:
Decidability Properties of Recursive Types. 242-255 - Roberto Bruni, José Meseguer, Ugo Montanari, Vladimiro Sassone:
Algebraic Theories for Contextual Pre-nets. 256-270 - Daniela Cancila, Furio Honsell:
A Coalgebraic Description of Web Interactions. 271-283 - Davide Ancona, Sonia Fagorzi, Elena Zucca:
A Calculus for Dynamic Linking. 284-301 - Giovanni Lagorio:
Towards a Smart Compilation Manager for Java. 302-315
Security and Cryptography
- Stelvio Cimato, Paolo D'Arco, Ivan Visconti:
Anonymous Group Communication in Mobile Networks. 316-328 - Amparo Fúster-Sabater:
Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences. 329-341 - Anna Lisa Ferrara, Barbara Masucci:
An Information-Theoretic Approach to the Access Control Problem. 342-354 - Massimo Bartoletti, Pierpaolo Degano, Gian-Luigi Ferrari:
Security-Aware Program Transformations. 355-368 - Annalisa Bossi, Damiano Macedonio, Carla Piazza, Sabina Rossi:
Information Flow Security and Recursive Systems. 369-382 - Fabio Martinelli, Marinella Petrocchi, Anna Vaccarelli:
Compositional Verification of Secure Streamed Data: A Case Study with EMSS. 383-396
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.