STACS 87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Frg, February 19-21 1987
ISBN 10: 354017219X ISBN 13: 9783540172192
Published by Springer Berlin / Heidelberg, 1987
Used
Soft cover
From
Better World Books, Mishawaka, IN, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since 3 August 2006
This specific item is no longer available.
About this Item
Description:
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. Seller Inventory # 1823960-6
Synopsis:
Stacs 87: 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, Frg, February 19-21, 1987
"About this title" may belong to another edition of this title.
Bibliographic Details
Title: STACS 87 : 4th Annual Symposium on ...
Publisher: Springer Berlin / Heidelberg
Publication Date: 1987
Binding: Soft cover
Condition: Good
Top Search Results from the AbeBooks Marketplace
Seller Image
STACS 87. 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987. 8ereinzelpicken
Published by
Berlin, Springer Berlin Heidelberg, 1987
ISBN 10: 354017219X
ISBN 13: 9783540172192
Used
Softcover
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Seller rating 5 out of 5 stars
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7782 354017219X Sprache: Englisch Gewicht in Gramm: 900. Seller Inventory # 2347480
Seller Image
STACS 87
Published by
Springer Berlin Heidelberg, 1987
ISBN 10: 354017219X
ISBN 13: 9783540172192
New
Softcover
Seller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Condition: 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. Seller Inventory # 4883381
Buy New
£ 40.81
£ 42.43 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
STACS 87 | 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987
Seller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. STACS 87 | 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987 | Franz J. Brandenburg (u. a.) | Taschenbuch | xii | Englisch | 1987 | Springer | EAN 9783540172192 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu. Seller Inventory # 101946074
Seller Image
STACS 87
Published by
Springer, Springer Feb 1987, 1987
ISBN 10: 354017219X
ISBN 13: 9783540172192
New
Taschenbuch
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540172192
Seller Image
STACS 87 : 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540172192
Seller Image
STACS 87
Published by
Springer Berlin Heidelberg Feb 1987, 1987
ISBN 10: 354017219X
ISBN 13: 9783540172192
New
Taschenbuch
Seller: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: 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. Seller Inventory # 9783540172192
Stock Image
STACS 87: 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987 (Lecture Notes in Computer Science, 247)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540172192_new
Buy New
£ 48.40
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Stock Image
STACS 87: 4th Annual Symposium on Theoretical Aspects of Computer Science, Passau, FRG, February 19-21, 1987 (Lecture Notes in Computer Science, 247)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Very Good. Dust Jacket may NOT BE INCLUDED.CDs may be missing. SHIPS FROM MULTIPLE LOCATIONS. book. Seller Inventory # ERICA790354017219X6
Buy Used
£ 103
£ 25 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available