Franz j brandenburg (16 risultati)

Condizione: New.

Condizione: New. Satisfaction Guaranteed or your money back. Aliki (illustratore).

Condizione: As New. Unread book in perfect condition.

Softcover. 1996. XII, 526 p. Unread book. Very good condition. Minimum traces of storage. 9783540607236 Sprache: Englisch Gewicht in Gramm: 748.

Condizione: New.

Nideggen, Eigenverlag 2008. 50 Seiten m. Abbildungen. Orig. Broschur mit Spiralheftung, 8°. Gut erhalten.

Condizione: As New. Unread book in perfect condition.

Condizione: As New. Unread book in perfect condition.

Condizione: New.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in processalgebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.…

Paperback. Condizione: Very Good. Used Very Good -Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book.

paperback. Condizione: Befriedigend. Seiten; 9780387172194.4 Gewicht in Gramm: 1.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in process algebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory. 500 pp. Englisch.…

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms usi.…

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Towards a theory of relativizations: Positive relativizations.- Natural semantics.- On local routing of two-terminal nets.- Geometric relations among Voronoi diagrams.- Finding the largest empty rectangle on a grated surface.- Efficient graph algorithms using limited communication on a fixed-size array of processors.- On selecting the largest element in spite of erroneous information.- The correlation between the complexities of the non-hierarchical and hierarchical versions of graph problems.- Graph isomorphism is in the low hierarchy.- A hierarchy theorem for almost everywhere complex sets with application to polynomial complexity degrees.- Self-reducibility.- Probability one separation of the Boolean hierarchy.- Reversal complexity of multicounter and multihead machines.- Computing the counting function of context-free languages.- On the k-freeness of morphisms on free monoids.- Avoidable patterns on 2 letters.- Polynomial operations on rational languages.- Some structural aspects of hypergraph languages generated by hyperedge replacement.- Specification and implementation of concurrently accessed data structures: An abstract data type approach.- On implementations of loose abstract data type specifications and their vertical composition.- Are homomorphisms sufficient for behavioural implementations of deterministic and nondeterministic data types .- Some remarks on presentations by finite Church-Rosser Thue systems.- Ground term confluence in parametric conditional equational specifications.- Describing semantic domains with sprouts.- Comparing direct and continuation semantics styles for concurrent languages.- Expressibility of first order logic with a nondeterministic inductive operator.- Bounded nondeterminism and the approximation induction principle in processalgebra.- The step failure semantics.- On the complexity of containment, equivalence, and reachability for finite and 2-dimensional vector addition systems with states.- Closure properties of deterministic Petri nets.- Some results on fairness: The regular case.- Decidability questions for fairness in Petri nets.- Optimal sorting on multi-dimensionally mesh-connected computers.- On the contact-minimization-problem.- Making distributed spanning tree algorithms fault-resilient.- The derivation of on-the-fly garbage collection algorithms from distributed termination detection protocols.- On the expected complexity of distributed selection.- LPG: A generic, logic and functional programming language.- CEC.- ASSPEGIQUE.- REVEUR4 : A laboratory for conditional rewriting.- An interactive, incremental and portable computer algebra system for -calculus and combinatory logic based on video edition and rewriting techniques.- The Passau RAP System: Rapid prototyping for algebraic specifications.- SPRAC: A software engineering environment.- SLOG: A logic interpreter for equational clauses.- An algebraic transformation system for occam programs.- REVE a rewrite rule laboratory.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 500 pp. Englisch.…

Leather Bound. Condizione: New. Language: English. Language: English. Presenting an Exquisite Leather-Bound Edition, expertly crafted with Original Natural Leather that gracefully adorns the spine and corners. The allure continues with Golden Leaf Printing that adds a touch of elegance, while Hand Embossing on the rounded spine lends an artistic flair. This masterpiece has been meticulously reprinted in 2025, utilizing the invaluable guidance of the original edition published many years ago in 1987. The contents of this book are presented in classic black and white. Its durability is ensured through a meticulous sewing binding technique, enhancing its longevity. Imprinted on top-tier quality paper. A team of professionals has expertly processed each page, delicately preserving its content without alteration. Due to the vintage nature of these books, every page has been manually restored for legibility. However, in certain instances, occasional blurriness, missing segments, or faint black spots might persist. We sincerely hope for your understanding of the challenges we faced with these books. Recognizing their significance for readers seeking insight into our historical treasure, we've diligently restored and reissued them. Our intention is to offer this valuable resource once again. We eagerly await your feedback, hoping that you'll find it appealing and will generously share your thoughts and recommendations. Lang: - English, Pages:- 697, Print on Demand. If it is a multi-volume set, then it is only a single volume. We are specialised in Customisation of books, if you wish to opt different color leather binding, you may contact us. This service is chargeable. Product Disclaimer: Kindly be informed that, owing to the inherent nature of leather as a natural material, minor discolorations or textural variations may be perceptible. Explore the FOLIO EDITION (12x19 Inches): Available Upon Request. 697 697.…