theoretical computer science 8th (12 Ergebnisse)

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.

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

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

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

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

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

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Eighth Italian Conference on Theoretical Computer Science (ICTCS 2003) was held at the University Residential Center of Bertinoro, Italy, on October 13 15 2003. The center is composed of three large historical and monumental buildings not far from one another, forming a united complex on the top of the built up area of the ancient town of Bertinoro. Previous conferences took place in Pisa (1972), Mantova (1974 and 1989), L Aquila (1992), Ravello (1995), Prato (1998), and Torino (2001). The conference aims at bringing together computer scientists, expecially youngresearchers,tofostercooperationandexchangeideasandresults.Itsmain topicsinclude:analysisanddesignofalgorithms,datatypesanddatastructures, theory of logical design and layout, computability, complexity, automata, s- bolic and algebraic computation, security, cryptography, speci cation and ve- cation, formal languages, foundations of functional programming, foundations of logic programming, term-rewriting, semantics, type theory, new computing paradigms, parallel and distributed computation, theory of concurrency, theory of databases, theory of knowledge bases, theory of robotics. The program committee, consisting of 14 members, considered 65 papers and selected 27 for presentation. These papers were selected on the basis of origin- ity, quality, and relevance to theoretical computer science. These proceedings include the revised versions of the 27 accepted papers and the invited talks by Marios Mavronicolas (Extreme Nash Equilibria), Martin Hofmann (Certi cation of Memory Usage), and G erard Boudol (On Programming Models for Mobility).

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

Taschenbuch. Zustand: 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-Verlag KG, Sachsenplatz 4-6, 1201 WIEN, ÖSTERREICH, productsafety[at]springernature[dot]com | Anbieter: preigu.

Taschenbuch. Zustand: Neu. STACS 91 | 8th Annual Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, February 14-16, 1991. Proceedings | Christian Choffrut (u. a.) | Taschenbuch | xiii | Englisch | 1991 | Springer | EAN 9783540537090 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

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