Theoretical Computer Science 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings /

Λεπτομέρειες βιβλιογραφικής εγγραφής
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Άλλοι συγγραφείς: Blundo, Carlo (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt), Laneve, Cosimo (Επιμελητής έκδοσης, http://id.loc.gov/vocabulary/relators/edt)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2003.
Έκδοση:1st ed. 2003.
Σειρά:Lecture Notes in Computer Science, 2841
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 04657nam a2200601 4500
001 978-3-540-45208-9
003 DE-He213
005 20191022092840.0
007 cr nn 008mamaa
008 121227s2003 gw | s |||| 0|eng d
020 |a 9783540452089  |9 978-3-540-45208-9 
024 7 |a 10.1007/b13810  |2 doi 
040 |d GrThAP 
050 4 |a QA75.5-76.95 
050 4 |a QA76.63 
072 7 |a UY  |2 bicssc 
072 7 |a COM014000  |2 bisacsh 
072 7 |a UY  |2 thema 
072 7 |a UYA  |2 thema 
082 0 4 |a 004.0151  |2 23 
245 1 0 |a Theoretical Computer Science  |h [electronic resource] :  |b 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings /  |c edited by Carlo Blundo, Cosimo Laneve. 
250 |a 1st ed. 2003. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2003. 
300 |a XII, 400 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2841 
505 0 |a 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. 
650 0 |a Computers. 
650 0 |a Data structures (Computer science). 
650 0 |a Algorithms. 
650 0 |a Computer logic. 
650 0 |a Mathematical logic. 
650 1 4 |a Theory of Computation.  |0 http://scigraph.springernature.com/things/product-market-codes/I16005 
650 2 4 |a Computation by Abstract Devices.  |0 http://scigraph.springernature.com/things/product-market-codes/I16013 
650 2 4 |a Data Structures.  |0 http://scigraph.springernature.com/things/product-market-codes/I15017 
650 2 4 |a Algorithm Analysis and Problem Complexity.  |0 http://scigraph.springernature.com/things/product-market-codes/I16021 
650 2 4 |a Logics and Meanings of Programs.  |0 http://scigraph.springernature.com/things/product-market-codes/I1603X 
650 2 4 |a Mathematical Logic and Formal Languages.  |0 http://scigraph.springernature.com/things/product-market-codes/I16048 
700 1 |a Blundo, Carlo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
700 1 |a Laneve, Cosimo.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662208502 
776 0 8 |i Printed edition:  |z 9783540202165 
830 0 |a Lecture Notes in Computer Science,  |x 0302-9743 ;  |v 2841 
856 4 0 |u https://doi.org/10.1007/b13810  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
912 |a ZDB-2-LNC 
912 |a ZDB-2-BAE 
950 |a Computer Science (Springer-11645)