Items related to Mathematical Foundations of Computer Science 1981:...
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118) - Softcover
Search results for Mathematical Foundations of Computer Science 1981:...
Stock Image
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science) (v. 118)
Seller: Zubal-Books, Since 1961, Cleveland, OH, U.S.A.
Seller rating 5 out of 5 stars
Condition: Good. 589 pp., Paperback, ex library, spine and joints worn, else text clean and binding tight. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. Seller Inventory # ZB695791
Quantity: 1 available
Seller Image
Mathematical Foundations of Computer Science 1981. 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings.
Published by
Berlin, Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
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. so7856 3540108564 Sprache: Englisch Gewicht in Gramm: 900. Seller Inventory # 2347554
Quantity: 1 available
Seller Image
Mathematical foundations of computer science Teil: 10. 1981., trbské Pleso, Czechoslovakia, August 31 - September 4, 1981 / Lecture notes in computer science ; 118
Published by
Berlin ; Heidelberg [u.a.] : Springer, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
Used
Softcover
Seller: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Germany
Seller rating 5 out of 5 stars
Softcover. 1981. XI, 589 S. : graph. Darst. Edition 1981! Unread book. Very good condition. Slight traces of storage. 9783540108566 Sprache: Englisch Gewicht in Gramm: 1001. Seller Inventory # 215040
Quantity: 1 available
Stock Image
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science)
Seller: GuthrieBooks, Spring Branch, TX, U.S.A.
Seller rating 5 out of 5 stars
Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments. Text block clean and unmarked. Tight binding. Seller Inventory # UTD14a-0215
Quantity: 1 available
Stock Image
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118)
Seller: Lucky's Textbooks, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # ABLIING23Mar3113020159154
Quantity: Over 20 available
Stock Image
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9783540108566_new
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1981 : 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
New
Taschenbuch
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A survey on oracle techniques.- Time and space bounded complexity classes and bandwidth constrained problems.- Representations of graphs by means of products and their complexity.- Parsing strategies: A concise survey.- The art of dynamizing.- Fast parallel computation of polynomials using few processors.- Generalizations of Petri nets.- Partial match retrieval in implicit data structures.- A characterization of Floyd-provable programs.- Semantics of CSP via translation into CCS.- More about the geography of context-free languages.- On the power of algebraic specifications.- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages.- On the complexity of word problems in certain Thue systems.- On the transformation of derivation graphs to derivation trees.- Pushdown automata with restricted use of storage symbols.- Structured nets.- Retraceability, repleteness and busy beaver sets.- Combining T and level-N.- On realization and implementation.- Multiplicative complexity of a bilinear form over a commutative ring.- Making dynamic logic first-order.- Partial interpretations of program schemata.- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.- Another hierarchy defined by multihead finite automata.- An extension of Rabin's complete proof concept.- How to find invariants for coloured Petri nets.- Relationships between probabilistic and deterministic tape complexity.- Grammatical levels of the position restricted grammars.- A general framework for comparing sequential and parallel rewriting.- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit.- Codings of nonnegative integers.- The maximum k-flow in a network.- On the constructive description of graph languages accepted by finite automata.- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries.- Maximum flow in planar networks.- Probabilistic combinatorial optimization.- Time-processor trade-offs for universal parallel computers.- Negative results on the size of deterministic right parsers.- Key-equivalence of functional dependency statements systems.- On representation of dynamic algebras with reversion.- A framework for studying grammars.- On existence of complete predicate calculus in metamathematics without exponentiation.- On structural similarity of context-free grammars.- Axioms for the term-wise correctness of programs.- Complexity and entropy.- Axiomatic semantics of indirect addressing.- Testing of join dependency preserving by a modified chase method.- A starvation-free solution of the dining philosophers' problem by use of interaction systems.- Admissible representations of effective cpo's.- Preserving total order in constant expected time.- Constructive category theory (No. 1).- Two pebbles don't suffice. Seller Inventory # 9783540108566
Quantity: 1 available
Seller Image
Mathematical Foundations of Computer Science 1981
Published by
Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
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. The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A s. Seller Inventory # 4881134
Quantity: Over 20 available
Seller Image
Mathematical Foundations of Computer Science 1981
Published by
Springer Berlin Heidelberg Aug 1981, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
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 -The complexity of manipulating hierarchically defined sets of rectangles.- The transformational machine: Theme and variations.- Probabilistic two-way machines.- A survey of some recent results on computational complexity in weak theories of arithmetic.- A survey on oracle techniques.- Time and space bounded complexity classes and bandwidth constrained problems.- Representations of graphs by means of products and their complexity.- Parsing strategies: A concise survey.- The art of dynamizing.- Fast parallel computation of polynomials using few processors.- Generalizations of Petri nets.- Partial match retrieval in implicit data structures.- A characterization of Floyd-provable programs.- Semantics of CSP via translation into CCS.- More about the geography of context-free languages.- On the power of algebraic specifications.- An application of the theory of free partially commutative monoids: Asymptotic densities of trace languages.- On the complexity of word problems in certain Thue systems.- On the transformation of derivation graphs to derivation trees.- Pushdown automata with restricted use of storage symbols.- Structured nets.- Retraceability, repleteness and busy beaver sets.- Combining T and level-N.- On realization and implementation.- Multiplicative complexity of a bilinear form over a commutative ring.- Making dynamic logic first-order.- Partial interpretations of program schemata.- Closure properties of the family of languages recognized by one-way two-head deterministic finite state automata.- Another hierarchy defined by multihead finite automata.- An extension of Rabin's complete proof concept.- How to find invariants for coloured Petri nets.- Relationships between probabilistic and deterministic tape complexity.- Grammatical levels of the position restricted grammars.- A general framework for comparing sequential and parallel rewriting.- A bin packing algorithm with complexity O(n log n) and performance 1 in the stochastic limit.- Codings of nonnegative integers.- The maximum k-flow in a network.- On the constructive description of graph languages accepted by finite automata.- Weighted multidimensional B-trees used as nearly optimal dynamic dictionaries.- Maximum flow in planar networks.- Probabilistic combinatorial optimization.- Time-processor trade-offs for universal parallel computers.- Negative results on the size of deterministic right parsers.- Key-equivalence of functional dependency statements systems.- On representation of dynamic algebras with reversion.- A framework for studying grammars.- On existence of complete predicate calculus in metamathematics without exponentiation.- On structural similarity of context-free grammars.- Axioms for the term-wise correctness of programs.- Complexity and entropy.- Axiomatic semantics of indirect addressing.- Testing of join dependency preserving by a modified chase method.- A starvation-free solution of the dining philosophers' problem by use of interaction systems.- Admissible representations of effective cpo's.- Preserving total order in constant expected time.- Constructive category theory (No. 1).- Two pebbles don't suffice. 608 pp. Englisch. Seller Inventory # 9783540108566
Quantity: 2 available
Stock Image
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118)
Seller: Mispah books, Redhill, SURRE, United Kingdom
Seller rating 4 out of 5 stars
Paperback. Condition: Very Good. Very Good. book. Seller Inventory # ERICA79035401085646
Quantity: 1 available