000 04202nam a22005895i 4500
001 978-3-540-45208-9
003 DE-He213
005 20240423132527.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 _a9783540452089
_9978-3-540-45208-9
024 7 _a10.1007/b13810
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
245 1 0 _aTheoretical Computer Science
_h[electronic resource] :
_b8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings /
_cedited by Carlo Blundo, Cosimo Laneve.
250 _a1st ed. 2003.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c2003.
300 _aXII, 400 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2841
505 0 _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 -- 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.
650 0 _aComputer science.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aAlgorithms.
650 0 _aMachine theory.
650 1 4 _aTheory of Computation.
650 2 4 _aData Science.
650 2 4 _aAlgorithms.
650 2 4 _aComputer Science Logic and Foundations of Programming.
650 2 4 _aFormal Languages and Automata Theory.
700 1 _aBlundo, Carlo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aLaneve, Cosimo.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540202165
776 0 8 _iPrinted edition:
_z9783662208502
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v2841
856 4 0 _uhttps://doi.org/10.1007/b13810
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c188746
_d188746