Theoretical Computer Science 8th (51 results)

PAPERBACK. Condition: 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.

Condition: 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. Condition: 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. Condition: 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.

Condition: New.

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

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: New.

paperback. Condition: 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. Condition: 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.

Condition: New.

Condition: New.

Condition: As New. Unread book in perfect condition.

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

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

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

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

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

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

Taschenbuch. Condition: 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. Condition: 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. …

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

Condition: New.

Taschenbuch. Condition: Neu. Theoretical Computer Science | 8th Italian Conference, ICTCS 2003, Bertinoro, Italy, October 13-15, 2003, Proceedings | Carlo Blundo (u. a.) | Taschenbuch | Einband - flex.(Paperback) | Englisch | 2003 | Springer | EAN 9783540202165 | Verantwortliche Person für die EU: Springer Nature Customer Service Center GmbH, Europaplatz 3, 69115 Heidelberg, productsafety[at]springernature[dot]com | Anbieter: preigu. …

Taschenbuch. Condition: Neu. Theoretical Computer Science | 8th IFIP TC 1/WG 2.2 International Conference, TCS 2014, Rome, Italy, September 1-3, 2014. Proceedings | Josep Diaz (u. a.) | Taschenbuch | xvi | Englisch | 2014 | Springer | EAN 9783662446010 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Paperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Condition: New.

Condition: New.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Polymorphism, parameterization and typing: An algebraic specification perspective.- Executable higher-order algebraic specifications.- Efficient memory access in large-scale computation.- l-occurrences of avoidable patterns.- Rational relations with bounded delay.- On the power of several queues.- On aperiodic trace languages.- Recognizable and rational languages of finite and infinite traces.- On the concatenation of infinite traces.- Tight RNC approximations to Max Flow.- A natural metric for curves - Computing the distance for polygonal chains and approximation algorithms.- The worst case complexity of MC Diarmid and Reed's variant of BOTTOM-UP-HEAT SORT is less than n log n+1.1n.- Decision problems for term rewriting systems and recognizable tree languages.- Decidable sentences for context-free groups.- The owner concept for PRAMs.- Actors as a parallel programming model.- Average case analysis of unification algorithms.- Methodology for proving the termination of logic programs.- Polynomial size constant depth circuits with a limited number of negations.- Randomized polynomials, threshold circuits, and the polynomial hierarchy.- Computationally convincing proofs of knowledge.- Interactive proof systems and alternating time-space complexity.- Optimal tradeoffs between time and bit complexity in distributed synchronous rings.- Unconditional Byzantine Agreement with good majority.- A new compacting garbage-collection algorithm with a good average-case performance.- Bisimulation and action refinement.- Testing for unboundedness of Fifo channels.- Detection of deadlocks in an infinite family of nets.- Nondeterminism within P.- Structure and importance of logspace-MOD-classes.- Complexity classification of Truth Maintenance systems.- Reachability in reversible FreeChoice systems.- Compositional generation of home states in free choice systems.- Bounded reductions.- Functional oracle queries as a measure of parallel time.- Optimal parallel recognition of bracket languages on hypercubes.- Constant queue routing on a mesh.- The complexity of the max word problem.- The expressive power of second order Horn logic.- Tight bounds on the path length of binary trees.- The random testability of the n-input AND gate.- An observational subset of first-order logic cannot specify the behaviour of a counter (extended abstract).- Unfolding, procedural and fixpoint semantics of logic programs.- A modal semantics for the negation as failure and the closed world assumption rules.- The relview-system.- Geometry models design system POM.- The prospectra system.- Prototype of a verification tool.- IPG - An interactive parser generator.- A placement system for constrained blocks with flexible shapes.- Algebraic programm interpreter APREX2.…