LEADER 05184nam 22007815 450 001 996465781303316 005 20200701165015.0 010 $a3-540-45208-7 024 7 $a10.1007/b13810 035 $a(CKB)1000000000212202 035 $a(SSID)ssj0000327182 035 $a(PQKBManifestationID)11231699 035 $a(PQKBTitleCode)TC0000327182 035 $a(PQKBWorkID)10301501 035 $a(PQKB)10641748 035 $a(DE-He213)978-3-540-45208-9 035 $a(MiAaPQ)EBC3089094 035 $a(PPN)155204955 035 $a(EXLCZ)991000000000212202 100 $a20121227d2003 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aTheoretical Computer Science$b[electronic resource] $e8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings /$fedited by Carlo Blundo, Cosimo Laneve 205 $a1st ed. 2003. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2003. 215 $a1 online resource (XII, 400 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2841 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-20216-1 320 $aIncludes bibliographical references and index. 327 $aInvited 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. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2841 606 $aComputers 606 $aData structures (Computer science) 606 $aAlgorithms 606 $aComputer logic 606 $aMathematical logic 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aComputation by Abstract Devices$3https://scigraph.springernature.com/ontologies/product-market-codes/I16013 606 $aData Structures$3https://scigraph.springernature.com/ontologies/product-market-codes/I15017 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aLogics and Meanings of Programs$3https://scigraph.springernature.com/ontologies/product-market-codes/I1603X 606 $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048 615 0$aComputers. 615 0$aData structures (Computer science). 615 0$aAlgorithms. 615 0$aComputer logic. 615 0$aMathematical logic. 615 14$aTheory of Computation. 615 24$aComputation by Abstract Devices. 615 24$aData Structures. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aLogics and Meanings of Programs. 615 24$aMathematical Logic and Formal Languages. 676 $a004 702 $aBlundo$b Carlo$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLaneve$b Cosimo$4edt$4http://id.loc.gov/vocabulary/relators/edt 712 12$aICTCS 2003 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465781303316 996 $aTheoretical computer science$9104541 997 $aUNISA