Verwandte Artikel zu Mathematical Foundations of Computer Science 1981:...
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings: 118 (Lecture Notes in Computer Science) - Softcover
Neu kaufen
Diesen Artikel anzeigen
EUR 48,37
Gratis für den Versand innerhalb von/der Deutschland
Versandziele, Kosten & Dauer
Suchergebnisse für Mathematical Foundations of Computer Science 1981:...
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981
Verlag:
Springer Science & Business Media, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
Gebraucht
Softcover
Anbieter: Bookbot, Prague, Tschechien
Verkäuferbewertung 5 von 5 Sternen
Softcover. Zustand: Fine. Leichte Risse; Farbveränderung durch Alter/Sonne. Bestandsnummer des Verkäufers 7e9b1594-92e3-4e1e-9557-dae87152db55
Anzahl: 2 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981. 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings.
Verlag:
Berlin, Springer Berlin Heidelberg, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
Gebraucht
Softcover
Anbieter: Antiquariat Bookfarm, Löbnitz, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 2347554
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical foundations of computer science Teil: 10. 1981., trbské Pleso, Czechoslovakia, August 31 - September 4, 1981 / Lecture notes in computer science ; 118
Verlag:
Berlin ; Heidelberg [u.a.] : Springer, 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
Gebraucht
Softcover
Anbieter: Roland Antiquariat UG haftungsbeschränkt, Weinheim, Deutschland
Verkäuferbewertung 5 von 5 Sternen
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. Bestandsnummer des Verkäufers 215040
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science) (v. 118)
Anbieter: Zubal-Books, Since 1961, Cleveland, OH, USA
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers ZB695791
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981
Print-on-DemandAnbieter: moluna, Greven, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: 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. Bestandsnummer des Verkäufers 4881134
Anzahl: Mehr als 20 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981 : 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540108566
Anzahl: 1 verfügbar
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981
ISBN 10: 3540108564
ISBN 13: 9783540108566
Neu
Taschenbuch
Anbieter: buchversandmimpf2000, Emtmannsberg, BAYE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Taschenbuch. Zustand: Neu. This item is printed on demand - Print on Demand Titel. 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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 608 pp. Englisch. Bestandsnummer des Verkäufers 9783540108566
Anzahl: 1 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118)
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes Königreich
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. In. Bestandsnummer des Verkäufers ria9783540108566_new
Anzahl: Mehr als 20 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981
Print-on-DemandAnbieter: Biblios, Frankfurt am main, HESSE, Deutschland
Verkäuferbewertung 5 von 5 Sternen
Zustand: New. PRINT ON DEMAND pp. 608. Bestandsnummer des Verkäufers 183072900
Anzahl: 4 verfügbar
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981
Anbieter: Books Puddle, New York, NY, USA
Verkäuferbewertung 4 von 5 Sternen
Zustand: New. pp. 608. Bestandsnummer des Verkäufers 263072910
Anzahl: 4 verfügbar