STACS 92: 9th: 9th Annual Symposium on Theoretical Aspects of Computer Science, Cachan, France, February 13-15, 1992, Proceedings (Lecture Notes in Computer Science)
16 Angebote vergleichen

Lieferung aus: Vereinigtes Königreich Großbritannien und Nordirland, Versandkosten nach: USA.
Von Händler/Antiquariat, PsychoBabel & Skoob Books.
Berlin: Springer-Verlag, 1992. Lecture Notes in Computer Science 577; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Small crease to leading lower corner of front cover. Sound, clean book with tight binding. ADG.. paperback. Very Good/No Dust Jacket. Ex-Library.

Von Händler/Antiquariat, PsychoBabel & Skoob Books [2917279], Didcot, OXON, United Kingdom.
Lecture Notes in Computer Science 577; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Small crease to leading lower corner of front cover. Sound, clean book with tight binding. ADG.

Von Händler/Antiquariat, Citi Retail [9235530], Lowfield Heath, CRAWL, United Kingdom.
Paperback. This volume contains the proceedings of STACS 91, a symposium on the theoretical aspects of computer science, held in Hamburg, Germany in February 1991. STACS is held.Shipping may be from our UK, US or Australian warehouse depending on stock availability. This item is printed on demand. 551 pages. 0.785.

Lieferung aus: Schweiz, Versandfertig innert 6 - 9 Werktagen.
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. Taschenbuch, 08.02.1991.

Von Händler/Antiquariat, Paperbackshop-US [8408184], Secaucus, NJ, U.S.A.
New Book. This item is printed on demand. Shipped from US This item is printed on demand.

Lieferung aus: Deutschland, Versandkostenfrei.
buecher.de GmbH & Co. KG, [1].
The proceedings of a symposium on the theoretical aspects of computer science are presented in this volume, which covers such topics as abstract data types, automata and formal languages, computational geometry, logic and semantics, robotics, VLSI structures, cryptography and systems theory.xiii, 551 S. XIII, 551 p. 233 mmVersandfertig in 3-5 Tagen, Softcover.

Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
This item is printed on demand. Paperback. This volume contains the proceedings of STACS 91, a symposium on the theoretical aspects of computer science, held in Hamburg, Germany in February 1991. STACS is held each year, alternately in Germany and France, and is organized jointly by the Special Interest Group for Theoretical Computer Science of the Gesellschaft fuer Informatik (GI) and the Special Interest Group for Applied Mathematics of the Association Francaise des Sciences et Techniques de lInformation et de Systemes (AFCET). The topics covered in this volume include abstract data types, algorithms and data structures, automata and formal languages, complexity of concrete algorithms, computational geometry, cryptography, computer systems theory, logic and semantics, mathematics of computation, program specification, theory of parallel and distributed computation, structural complexity, theory of robotics, VLSI structures, and the theory of databases. This item ships from La Vergne,TN.

Von Händler/Antiquariat, Herb Tandree Philosophy Books [17426], Stroud, United Kingdom.
9783540537090 Paperback, This listing is a new book, a title currently in-print which we order directly and immediately from the publisher.

Von Händler/Antiquariat, BuySomeBooks [52360437], Las Vegas, NV, U.S.A.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen

Von Händler/Antiquariat, GuthrieBooks [52069477], Spring Branch, TX, U.S.A.
3540552103 Ex-library paperback in very nice condition with the usual markings and attachments.