Vai al contenuto principale della pagina
Titolo: | Theoretical Computer Science : 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings / / edited by Carlo Blundo, Cosimo Laneve |
Pubblicazione: | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2003 |
Edizione: | 1st ed. 2003. |
Descrizione fisica: | 1 online resource (XII, 400 p.) |
Disciplina: | 004 |
Soggetto topico: | Computers |
Data structures (Computer science) | |
Algorithms | |
Computer logic | |
Mathematical logic | |
Theory of Computation | |
Computation by Abstract Devices | |
Data Structures | |
Algorithm Analysis and Problem Complexity | |
Logics and Meanings of Programs | |
Mathematical Logic and Formal Languages | |
Persona (resp. second.): | BlundoCarlo |
LaneveCosimo | |
Note generali: | Bibliographic Level Mode of Issuance: Monograph |
Nota di bibliografia: | Includes bibliographical references and index. |
Nota di contenuto: | 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 -- An Information-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. |
Titolo autorizzato: | Theoretical computer science |
ISBN: | 3-540-45208-7 |
Formato: | Materiale a stampa |
Livello bibliografico | Monografia |
Lingua di pubblicazione: | Inglese |
Record Nr.: | 9910768183003321 |
Lo trovi qui: | Univ. Federico II |
Opac: | Controlla la disponibilità qui |