Theoretical computer science 8th (55 résultats)

PAPERBACK. Etat : Good. Top corner has a bit of curve from storage issue. Binding solid, pages crisp and clean, no markings found. Covers bright and shiny with light scuffs and dents. Extremities lightly bumped with minimal tip wear.

Etat : good. A copy that has been read, remains in good condition. All pages are intact, and the cover is intact. The spine and cover show signs of wear. Pages can include notes and highlighting and show signs of wear, and the copy can include "From the library of" labels or previous owner inscriptions. 100% GUARANTEE! Shipped with delivery confirmation, if you're not satisfied with purchase please return item! Ships via media mail.…

Paperback. Etat : Very Good. 1st ed. 2019. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Paperback. Etat : Very Good. 1st ed. 2019. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.

Etat : New.

Paperback or Softback. Etat : New. Theoretical Computer Science: 8th Italian Conference, Ictcs 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings. Book.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : New.

paperback. Etat : Acceptable. Connecting readers with great books since 1972. Used textbooks may not include companion materials such as access codes, etc. May have condition issues including wear and notes/highlighting. We ship orders daily and Customer Service is our top priority.

paperback. Etat : Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority.

Etat : New.

Etat : New.

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New. In English.

Etat : As New. Unread book in perfect condition.

Etat : New. 1st ed. 2018 edition NO-PA16APR2015-KAP.

Etat : New. 1st ed. 2018 edition NO-PA16APR2015-KAP.

Paperback. Etat : Brand New. revised edition. 296 pages. 9.00x6.25x0.75 inches. In Stock.

Paperback. Etat : Brand New. 2012 edition. 370 pages. 9.50x6.50x0.75 inches. In Stock.

Paperback. Etat : Brand New. 1st edition. 428 pages. 9.25x6.25x1.25 inches. In Stock.

Etat : New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 8th FIP WG 2.2 International Conference, TCS 2014, held in Rome, Italy, in September 2014.The 26 revised full papers presented, together with two invited talks, were carefully reviewed and selected from 73 submissions. [Suggestion--please check and add more if needed]TCS-2014 consisted of two tracks, with separate program committees, which dealt respectively with: - Track A: Algorithms, Complexity and Models of Computation, and- Track B: Logic, Semantics, Specification and Verification.…

Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.…

Etat : New. 1st ed. 2021 edition NO-PA16APR2015-KAP.

Etat : New.

Etat : New. In English.