Michele Pinna (22 results)

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.…

Condition: NEW.

Condition: NEW.

Heft. Condition: Sehr gut. 32 S., 24cm Zustand: sehr gut --- Inhalt: italienischer Text, illustriert KK-Ordner ISBN: 03696243 Sprache: Italienisch Gewicht in Gramm: 250.

Condition: As New. Unread book in perfect condition.

Condition: New.

Condition: NEW.

Condition: NEW.

Condition: New.

Condition: New. In English.

Condition: As New. Unread book in perfect condition.

Condition: New. pp. 432.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Invited Contributions.- Semantic Subtyping: Challenges, Perspectives, and Open Problems.- Biological Systems as Reactive Systems.- Mobile Agents Computing: Security Issues and Algorithmic Solutions.- Technical Contributions.- Efficient Algorithms for Detecting Regular Point Configurations.- Pickup and Delivery for Moving Objects on Broken Lines.- A Static Analysis of PKI-Based Systems.- Subtyping Object and Recursive Types Logically.- The Language : Circuits, Computations and Classical Logic.- Checking Risky Events Is Enough for Local Policies.- The Graph Rewriting Calculus: Confluence and Expressiveness.- Safe Object Composition in the Presence of Subtyping.- Reachability Analysis in Boxed Ambients.- Error Mining for Regular Expression Patterns.- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections.- Inapproximability Results for the Lateral Gene Transfer Problem.- Faster Deterministic Wakeup in Multiple Access Channels.- Weighted Coloring: Further Complexity and Approximability Results.- Quantum Algorithms for a Set of Group Theoretic Problems.- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs.- A Polymerase Based Algorithm for SAT.- Laxity Helps in Broadcast Scheduling.- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.- Synthesis from Temporal Specifications Using Preferred Answer Set Programming.- Model Checking Strategic Abilities of Agents Under Incomplete Information.- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.- A Theoretical Analysis of Alignment and Edit Problems for Trees.- A Complete Formulation of Generalized Affine Equivalence.- A New Combinatorial Approach to SequenceComparison.- A Typed Assembly Language for Non-interference.- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.- A Typed Semantics of Higher-Order Store and Subtyping.- Two Variables Are Not Enough.…

119 p., 21 cm, bross.

PF. Condition: New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -The 9th Italian Conference on Theoretical Computer Science (ICTCS 2005)was held at the Certosa di Pontignano, Siena, Italy, on October 12 14 2005. The Certosa di Pontignano is the conference center of the University of Siena; it is located 8 km away from the town and it is in the Chianti region. The Certosa is a place full of history (founded in the 15th century, it was set on re a century later and reconstructed) and of valuable artworks, like frescoes of the Scuola Senese. Previous conferences took place in Pisa (1972), Mantova (1974 and 1989), L Aquila(1992),Ravello(1995),Prato(1998),Turin(2001)andBertinoro(2003). Theconferenceaimsatbringingtogethercomputerscientists,especiallyyoung researchers, to foster cooperation, exchange of ideas and results. Great e orts have been made to attract researchers from all over the world. The main t- ics of the conference cover all the elds of theoretical computer science and include analysis and design of algorithms, computability, computational c- plexity, cryptography, formal languages and automata, foundations of progr- ming languages and program analysis, foundations of arti cial intelligence and knowledge representation, foundations of web programming, natural computing paradigms (quantum computing, bioinformatics), parallel and distributed c- putation, program speci cation and veri cation, term rewriting, theory of c- currency, theory of data bases, theory of logical design and layout, type theory, security, and symbolic and algebraic computation. 432 pp. Englisch.…

Leatherbound. Condition: NEW. BOOKS ARE EXEMPT FROM IMPORT DUTIES AND TARIFFS; NO EXTRA CHARGES APPLY. Leatherbound edition. Condition: New. Leather Binding on Spine and Corners with Golden leaf printing on spine. Bound in genuine leather with Satin ribbon page markers and Spine with raised gilt bands. Pages: 388. A perfect gift for your loved ones. Reprinted from 1914 edition. NO changes have been made to the original text. This is NOT a retyped or an ocr'd reprint. Illustrations, Index, if any, are included in black and white. Each page is checked manually before printing. As this print on demand book is reprinted from a very old book, there could be some missing or flawed pages, but we always try to make the book as complete as possible. Fold-outs, if any, are not part of the book. If the original book was published in multiple volumes then this reprint is of only one volume, not the whole set. IF YOU WISH TO ORDER PARTICULAR VOLUME OR ALL THE VOLUMES YOU CAN CONTACT US. Resized as per current standards. Sewing binding for longer life, where the book block is actually sewn (smythe sewn/section sewn) with thread before binding which results in a more durable type of binding. Language: Italian Pages: 388.…

Condition: New. Print on Demand pp. 432 Illus.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Invited Contributions.- Semantic Subtyping: Challenges, Perspectives, and Open Problems.- Biological Systems as Reactive Systems.- Mobile Agents Computing: Security Issues and Algorithmic Solutions.- Technical Contributions.- Efficient Algorithms for Detect.…

Condition: New. PRINT ON DEMAND pp. 432.

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Invited Contributions.- Semantic Subtyping: Challenges, Perspectives, and Open Problems.- Biological Systems as Reactive Systems.- Mobile Agents Computing: Security Issues and Algorithmic Solutions.- Technical Contributions.- Efficient Algorithms for Detecting Regular Point Configurations.- Pickup and Delivery for Moving Objects on Broken Lines.- A Static Analysis of PKI-Based Systems.- Subtyping Object and Recursive Types Logically.- The Language : Circuits, Computations and Classical Logic.- Checking Risky Events Is Enough for Local Policies.- The Graph Rewriting Calculus: Confluence and Expressiveness.- Safe Object Composition in the Presence of Subtyping.- Reachability Analysis in Boxed Ambients.- Error Mining for Regular Expression Patterns.- Reconstructing an Alternate Periodical Binary Matrix from Its Orthogonal Projections.- Inapproximability Results for the Lateral Gene Transfer Problem.- Faster Deterministic Wakeup in Multiple Access Channels.- Weighted Coloring: Further Complexity and Approximability Results.- Quantum Algorithms for a Set of Group Theoretic Problems.- On the Computational Complexity of the L (2,1)-Labeling Problem for Regular Graphs.- A Polymerase Based Algorithm for SAT.- Laxity Helps in Broadcast Scheduling.- Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory.- Synthesis from Temporal Specifications Using Preferred Answer Set Programming.- Model Checking Strategic Abilities of Agents Under Incomplete Information.- Improved Algorithms for Polynomial-Time Decay and Time-Decay with Additive Error.- A Theoretical Analysis of Alignment and Edit Problems for Trees.- A Complete Formulation of Generalized Affine Equivalence.- A New Combinatorial Approach to SequenceComparison.- A Typed Assembly Language for Non-interference.- Improved Exact Exponential Algorithms for Vertex Bipartization and Other Problems.- A Typed Semantics of Higher-Order Store and Subtyping.- Two Variables Are Not Enough.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 432 pp. Englisch. …

Taschenbuch. Condition: Neu. Theoretical Computer Science | 9th Italian Conference, ICTCS 2005, Siena, Italy, October 12-14, 2005, Proceedings | Mario Coppo (u. a.) | Taschenbuch | xi | Englisch | 2005 | Springer | EAN 9783540291060 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. …