CAAP '83: Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings: 159 (Lecture Notes in Computer Science, 159) - Softcover
Synopsis
With contributions by numerous experts
"synopsis" may belong to another edition of this title.
Other Popular Editions of the Same Title
Search results for CAAP '83: Trees in Algebra and Programming. 8th...
Seller Image
Caap '83 : Trees in Algebra and Programming. 8th Colloquium L'aquila, March 9-11, 1983. Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition. Seller Inventory # 5908300
Stock Image
CAAP '83: Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings (Lecture Notes in Computer Science, 159)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540127277_new
Buy New
£ 50.80
£ 11.98 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: Over 20 available
Seller Image
Caap '83 : Trees in Algebra and Programming. 8th Colloquium L'aquila, March 9-11, 1983. Proceedings
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5908300-n
Seller Image
CAAP '83
Published by
Springer Berlin Heidelberg, Springer Berlin Heidelberg Okt 1983, 1983
ISBN 10: 3540127275
ISBN 13: 9783540127277
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 -With contributions by numerous experts 428 pp. Englisch. Seller Inventory # 9783540127277
Seller Image
CAAP 83
Published by
Springer Berlin Heidelberg, 1983
ISBN 10: 3540127275
ISBN 13: 9783540127277
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. With contributions by numerous expertsGeneralized heterogeneous algebras and partial interpretations.- Applicative information systems.- Acyclic database schemes (of various degrees): A painless introduction.- Efficient algorithms for finding maximal ma. Seller Inventory # 4881931
Buy New
£ 42.48
£ 41.78 shipping
Ships from Germany to U.S.A.
Ships from Germany to U.S.A.
Quantity: Over 20 available
Seller Image
CAAP83. Trees in Algebra and Programming 8th Colloquium LAquila, March 9-11, 1983 Proceeding. (=Lecture Notes in Computer Science; 159).
Seller: ralfs-buecherkiste, Herzfelde, MOL, Germany
Seller rating 5 out of 5 stars
Broschur. Condition: Gut. 416 S. Computerwissenschaften Mathematik Mathematics Guter Zustand/ Good. Ex-Library. Brownish paper. ha1082113 Sprache: Englisch Gewicht in Gramm: 700. Seller Inventory # 397772
Seller Image
CAAP '83
Published by
Springer, Springer Okt 1983, 1983
ISBN 10: 3540127275
ISBN 13: 9783540127277
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 -Generalized heterogeneous algebras and partial interpretations.- Applicative information systems.- Acyclic database schemes (of various degrees): A painless introduction.- Efficient algorithms for finding maximal matching in graphs.- A survey of NLC grammars.- Prefix and perfect languages.- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets.- VLSI mesh of trees for data base processing.- Continuite des transducteurs d'etats finis d'arbres.- Completeness results for a polymorphic type system.- A class of program schemes based on tree rewriting systems.- Complete sets of unifiers and matchers in equational theories.- Digital search trees and the generation of an exponentially distributed variate.- Decidable properties of monadic recursive schemas with a depth parameter.- Nivat-processing systems: Decision problems related to protection and synchronization.- Confluent and coherent equational term rewriting systems application to proofs in abstract data types.- An application of maximum bipartite c-matching to subtree isomorphism'.- Characterizing specification languages which admit initial semantics.- Topological bandwidth.- Probabilistic analysis of graph colouring algorithms.- Some further approximation algorithms for the vertex cover problem.- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes.- Remarks on the pyramidal structure.- Structured theories in LCF.- Alternating tree automata.- Cofinality in reduction graphs.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 428 pp. Englisch. Seller Inventory # 9783540127277
Seller Image
CAAP '83 : Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Generalized heterogeneous algebras and partial interpretations.- Applicative information systems.- Acyclic database schemes (of various degrees): A painless introduction.- Efficient algorithms for finding maximal matching in graphs.- A survey of NLC grammars.- Prefix and perfect languages.- Some equivalence results for free choice nets and simple nets and on the periodicity of live free choice nets.- VLSI mesh of trees for data base processing.- Continuite des transducteurs d'etats finis d'arbres.- Completeness results for a polymorphic type system.- A class of program schemes based on tree rewriting systems.- Complete sets of unifiers and matchers in equational theories.- Digital search trees and the generation of an exponentially distributed variate.- Decidable properties of monadic recursive schemas with a depth parameter.- Nivat-processing systems: Decision problems related to protection and synchronization.- Confluent and coherent equational term rewriting systems application to proofs in abstract data types.- An application of maximum bipartite c-matching to subtree isomorphism'.- Characterizing specification languages which admit initial semantics.- Topological bandwidth.- Probabilistic analysis of graph colouring algorithms.- Some further approximation algorithms for the vertex cover problem.- An application of the theory of graphs and hypergraphs to the decomposition of relational database schemes.- Remarks on the pyramidal structure.- Structured theories in LCF.- Alternating tree automata.- Cofinality in reduction graphs. Seller Inventory # 9783540127277
Seller Image
CAAP '83 | Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings
Print on DemandSeller: preigu, Osnabrück, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. CAAP '83 | Trees in Algebra and Programming. 8th Colloquium L'Aquila, March 9-11, 1983. Proceedings | G. Ausiello (u. a.) | Taschenbuch | x | Englisch | 1983 | Springer | EAN 9783540127277 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu Print on Demand. Seller Inventory # 102154196
Stock Image
CAAP *83: Trees in Algebra and Programming. 8th Colloquium L*Aquila, March 9-11, 1983. Proceedings (Lecture Notes in Computer Science, 159) (English and French Edition)
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 # ERICA79035401272756
Buy Used
£ 101
£ 25 shipping
Ships from United Kingdom to U.S.A.
Ships from United Kingdom to U.S.A.
Quantity: 1 available