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
Zu dieser ISBN ist aktuell kein Angebot verfügbar.
Alle Exemplare der Ausgabe mit dieser ISBN anzeigen:
- VerlagSpringer
- Erscheinungsdatum2008
- ISBN 10 3540108564
- ISBN 13 9783540108566
- EinbandTapa blanda
- Anzahl der Seiten612
Neu kaufen
Mehr zu diesem Angebot erfahren
EUR 54,89
Versand:
Gratis
Innerhalb der USA
Beste Suchergebnisse bei AbeBooks
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science (118)) by Chytil, M., Gruska, J. [Paperback ]
Anbieter:
Bewertung
Buchbeschreibung Soft Cover. Zustand: new. Bestandsnummer des Verkäufers 9783540108566
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 54,89
Währung umrechnen
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:
Bewertung
Buchbeschreibung Zustand: New. Bestandsnummer des Verkäufers ABLIING23Mar3113020159154
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 57,80
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981 : 10th Symposium Strbske Pleso; Czechoslovakia; August 31- September 4; 1981. Proceedings
Print-on-Demand
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Bestandsnummer des Verkäufers ria9783540108566_lsuk
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 60,38
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. pp. 608. Bestandsnummer des Verkäufers 263072910
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 73,56
Währung umrechnen
Beispielbild für diese ISBN
Mathematical Foundations of Computer Science 1981
Print-on-Demand
Anbieter:
Bewertung
Buchbeschreibung Zustand: New. Print on Demand pp. 608 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam. Bestandsnummer des Verkäufers 5856337
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 77,11
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981 : 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings
Verlag:
Springer Berlin Heidelberg
(1981)
ISBN 10: 3540108564
ISBN 13: 9783540108566
Neu
Taschenbuch
Anzahl: 1
Anbieter:
Bewertung
Buchbeschreibung 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
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 59,51
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981
Verlag:
Springer Berlin Heidelberg
(1981)
ISBN 10: 3540108564
ISBN 13: 9783540108566
Neu
Softcover
Anzahl: > 20
Anbieter:
Bewertung
Buchbeschreibung 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
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 48,37
Währung umrechnen
Foto des Verkäufers
Mathematical Foundations of Computer Science 1981
Verlag:
Springer Berlin Heidelberg Aug 1981
(1981)
ISBN 10: 3540108564
ISBN 13: 9783540108566
Neu
Taschenbuch
Anzahl: 2
Anbieter:
Bewertung
Buchbeschreibung Taschenbuch. Zustand: 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. Bestandsnummer des Verkäufers 9783540108566
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 106,99
Währung umrechnen
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:
Bewertung
Buchbeschreibung Zustand: New. Buy with confidence! Book is in new, never-used condition. Bestandsnummer des Verkäufers bk3540108564xvz189zvxnew
Weitere Informationen zu diesem Verkäufer | Verkäufer kontaktieren
Neu kaufen
EUR 137,18
Währung umrechnen