KI-Beratung Beta

Produktbild: Theoretical Computer Science
Band 2841

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

51,99 €

inkl. gesetzl. MwSt., Versandkostenfrei


Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.09.2003

Abbildungen

XII, 400 p.

Herausgeber

Carlo Blundo + weitere

Verlag

Springer Berlin

Seitenzahl

400

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

622 g

Auflage

2003

Sprache

Englisch

ISBN

978-3-540-20216-5

Beschreibung

Produktdetails

Einband

Taschenbuch

Erscheinungsdatum

29.09.2003

Abbildungen

XII, 400 p.

Herausgeber

Verlag

Springer Berlin

Seitenzahl

400

Maße (L/B/H)

23,5/15,5/2,3 cm

Gewicht

622 g

Auflage

2003

Sprache

Englisch

ISBN

978-3-540-20216-5

Herstelleradresse

Springer-Verlag GmbH
Tiergartenstr. 17
69121 Heidelberg
DE

Email: ProductSafety@springernature.com

Noch keine Bewertungen vorhanden

Verfassen Sie die erste Bewertung zu diesem Artikel

Helfen Sie anderen Kundinnen und Kunden durch Ihre Meinung.

Kundinnen und Kunden meinen

Bewertungen (0)

  • Produktbild: Theoretical Computer Science
  • 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.