Theoretical computer science : 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003 : proceedings
Enregistré dans:
| Collectivité auteur: | |
|---|---|
| Autres auteurs: | , |
| Format: | Livre numérique |
| Langue: | Anglais |
| Publié: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Collection: | Lecture notes in computer science
2841 |
| Sujets: | |
| Accès en ligne: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Note: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Theoretical computer science, 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, proceedings, Carlo Blundo, Cosimo Laneve, eds, Berlin, Springer, 2003, 1 vol. (XI-396 p.), Lecture notes in computer science, 3-540-20216-1 • Theoretical Computer Science, Texte imprimé, 9783662208502 |
Table des matières:
- Invited Talks
- Extreme Nash Equilibria
- Certification of Memory Usage
- On Programming Models for Mobility
- Program Design, Models and Analysis
- On the Computational Complexity of Cut-Elimination in Linear Logic
- A Constructive Proof of the Soundness of the Encoding of Random Access Machines in a Linda Calculus with Ordered Semantics
- Finite Horizon Analysis of Stochastic Systems with the Mur? Verifier
- Towards Compact and Tractable Automaton-Based Representations of Time Granularities
- Lower Bounds on the Size of Quantum Automata Accepting Unary Languages
- Refined Effects for Unanticipated Object Re-classification:
- Algorithms and Complexity
- Cost Constrained Fixed Job Scheduling
- A Work-Optimal Coarse-Grained PRAM Algorithm for Lexicographically First Maximal Independent Set
- An Approximation Algorithm for the Minimum Weight Vertex-Connectivity Problem in Complete Graphs with Sharpened Triangle Inequality
- Channel Assignment in Honeycomb Networks
- Exact Solution of a Class of Frequency Assignment Problems in Cellular Networks
- The Complexity of Checking Consistency of Pedigree Information and Related Problems
- On Clausal Equivalence and Hull Inclusion
- Semantics and Formal Languages
- Logical Semantics for the First Order ?-Calculus
- On the Expressive Power of Light Affine Logic
- Reasoning about Self and Others: Communicating Agents in a Modal Action Logic
- Decidability Properties of Recursive Types
- Algebraic Theories for Contextual Pre-nets
- A Coalgebraic Description of Web Interactions
- A Calculus for Dynamic Linking
- Towards a Smart Compilation Manager for Java
- Security and Cryptography
- Anonymous Group Communication in Mobile Networks
- Aspects of Pseudorandomness in Nonlinear Generators of Binary Sequences
- AnInformation-Theoretic Approach to the Access Control Problem
- Security-Aware Program Transformations
- Information Flow Security and Recursive Systems
- Compositional Verification of Secure Streamed Data: A Case Study with EMSS.