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. N� de ref. del art�culo: 2347554

Contactar al vendedor

Comprar usado

EUR 11,52

Convertir moneda

Gastos de env�o: EUR 7,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science) (v. 118)

J. Gruska, M. Chytil

Publicado por Springer, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Antiguo o usado Tapa blanda

Librería: Zubal-Books, Since 1961, Cleveland, OH, Estados Unidos de America

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: Good. *Price HAS BEEN REDUCED by 10% until Monday, June 23. Order now for BEST SAVINGS* 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. N� de ref. del art�culo: ZB695791

Contactar al vendedor

Comprar usado

EUR 14,54

Convertir moneda

Gastos de env�o: EUR 20,82

De Estados Unidos de America a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical foundations of computer science Teil: 10. 1981., trbsk� Pleso, Czechoslovakia, August 31 - September 4, 1981 / Lecture notes in computer science ; 118

Chytil, M. und J. Gruska:

Publicado por Berlin ; Heidelberg [u.a.] : Springer, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Antiguo o usado Softcover

Librería: Roland Antiquariat UG haftungsbeschr�nkt, Weinheim, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

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. N� de ref. del art�culo: 215040

Contactar al vendedor

Comprar usado

EUR 24,90

Convertir moneda

Gastos de env�o: EUR 11,95

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1981 : 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings

M. Chytil

Publicado por Springer Berlin Heidelberg, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Nuevo Taschenbuch

Librería: AHA-BUCH GmbH, Einbeck, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: 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. N� de ref. del art�culo: 9783540108566

Contactar al vendedor

Comprar nuevo

EUR 53,49

Convertir moneda

Gastos de env�o: EUR 11,99

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Mathematical Foundations of Computer Science 1981: 10th Symposium Strbske Pleso, Czechoslovakia, August 31- September 4, 1981. Proceedings (Lecture Notes in Computer Science, 118)

Chytil, M.; Gruska, J.

Publicado por Springer, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Nuevo Tapa blanda

Librería: Ria Christie Collections, Uxbridge, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: New. In. N� de ref. del art�culo: ria9783540108566_new

Contactar al vendedor

Comprar nuevo

EUR 61,11

Convertir moneda

Gastos de env�o: EUR 4,65

De Reino Unido a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1981

Gruska, Josef|Chytil, Michal P.

Publicado por Springer Berlin Heidelberg, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: moluna, Greven, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: 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. N� de ref. del art�culo: 4881134

Contactar al vendedor

Comprar nuevo

EUR 48,37

Convertir moneda

Gastos de env�o: EUR 19,49

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: M�s de 20 disponibles

A�adir al carrito

Imagen del vendedor

Mathematical Foundations of Computer Science 1981

M. Chytil

Publicado por Springer Berlin Heidelberg, Springer Berlin Heidelberg Aug 1981, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Nuevo Taschenbuch

Impresi�n bajo demanda

Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania

Calificaci�n del vendedor: 5 de 5 estrellas

Taschenbuch. Condici�n: 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. N� de ref. del art�culo: 9783540108566

Contactar al vendedor

Comprar nuevo

EUR 53,49

Convertir moneda

Gastos de env�o: EUR 35,00

De Alemania a Espa�a

Destinos, gastos y plazos de env�o

Cantidad disponible: 1 disponibles

A�adir al carrito

Imagen de archivo

Mathematical Foundations of Computer Science 1981

Chytil, M.; Gruska, J.

Publicado por Springer, 1981

ISBN 10: 3540108564 ISBN 13: 9783540108566

Nuevo Tapa blanda

Impresi�n bajo demanda

Librería: Majestic Books, Hounslow, Reino Unido

Calificaci�n del vendedor: 5 de 5 estrellas

Condici�n: 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. N� de ref. del art�culo: 5856337

Contactar al vendedor