choffrut (23 Ergebnisse)

Softcover. Zustand: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2017. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 2017. Ammareal gives back up to 15% of this item's net price to charity organizations.

Softcover. Zustand: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2017. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2017. Ammareal gives back up to 15% of this item's net price to charity organizations.

Softcover. Zustand: Très bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2017. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Very good. Former library book. Slight signs of wear on the cover. Edition 2017. Ammareal gives back up to 15% of this item's net price to charity organizations.

Paperback. Zustand: Very Good. Zustand des Schutzumschlags: No Dust Jacket. Lecture Notes in Computer Science 480; Ex-Library. Previous owner's sticker on the front cover. Ink stamp and small pen inscription on title page; library catalogue sticker on colophon. Traces of sticker residue across spine head; faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Softcover. Zustand: Bon. Ancien livre de bibliothèque. Légères traces d'usure sur la couverture. Edition 2017. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Slight signs of wear on the cover. Edition 2017. Ammareal gives back up to 15% of this item's net price to charity organizations.

Zustand: very good. Gut/Very good: Buch bzw. Schutzumschlag mit wenigen Gebrauchsspuren an Einband, Schutzumschlag oder Seiten. / Describes a book or dust jacket that does show some signs of wear on either the binding, dust jacket or pages.

Zustand: Très bon. Merci, votre achat aide à financer des programmes de lutte contre l'illettrisme.

Paperback. Zustand: Very Good. Zustand des Schutzumschlags: No Dust Jacket. Lecture Notes in Computer Science 415; Ex-Library. Ink stamp and previous owner's sticker on the front cover. Small pen inscription on title page; library catalogue sticker on colophon. Bumped spine head and corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Format groß 8°,LEINEN, der Einband ist durch eine zusätzliche feste Transparentschutzfolie geschützt, 125 nachgedunkelte Seiten, dies ist ein regulär ausgesondertes Bibliotheksexemplar aus einer wissenschaftlichen Bibliothek, keine Markierungen / Anmerkungen, das Buch befindet sich in einem sehr guten Zustand --- Lib.Ex.,LINEN BINDING, no marks, cover in foil, 125 a bit darkened pages, very good condition. Shipping to abroad insured with tracking number.

Zustand: Neuf.

Zustand: Neuf.

311 S. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7772 3540522824 Sprache: Englisch Gewicht in Gramm: 900.

Zustand: Gut. Auflage: 1990. 324 Seiten ex Library Book / aus einer wissenschafltichen Bibliothek / Sprache: Englisch Gewicht in Gramm: 1004 23,5 x 15,5 x 1,9 cm, Taschenbuch.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Symposium on Theoretical Aspects of Computer Science is organized jointly by the Special Interest Group for Applied Mathematics of AFCET (Association Française de Cybernétique Economique et Technique) and the Special Interest Group for Theoretical Computer Sciences of GI (Gesellschaft für Informatik). It is held alternately in France and in Germany. This volume contains two invited papers, on combinatorial methods in computer science, and on the complexity of local optimization, and 24 contributions on theoretical aspects of computer science. Some software systems are presented showing the possibilities of applying theoretical research to the realization of software tools.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This volume contains the proceedings of the 14th Spring School of the LITP (Laboratoire d`Informatique Théorique et de Programmation, Université Paris VI-VII, CNRS) held May 12-16, 1986 in Argelès-Village on the French Catalan coast. This meeting was organized by C. Choffrut, M. Nivat, F. Robert, P. Sallé and gathered a hundred participants. The proceedings of the last two Spring Schools have already been published in this series and deal with 'Automata on Infinite Words' (LNCS 192) and 'Combinators and Functional Programming Languages' (LNCS 242). The purpose of this yearly meeting is to present the state of the art in a specific topic which has gained considerable maturity. The field chosen this year was the theory of automata networks. Though the content of this book is essentially restricted to computer science aspects of the topic, illustrations were given at the meeting on how the model of cellular automata could be used to solve problems in statistical, fluid and solid state mechanics. Applications to biology with growth models also exist.

Zustand: New.

Zustand: New.

Zustand: New. In.

Zustand: New. In.

Paperback. Zustand: Brand New. 398 pages. French language. 9.37x6.14x0.79 inches. In Stock.

Taschenbuch. Zustand: 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 Free Choice 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.

Zustand: New. 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.

Zustand: New. In.