Monien B (17 results)

Paperback. Condition: Very Good. Ex-library paperback in very nice condition with the usual markings and attachments.

Paperback. Condition: Very Good. No Jacket. 1st. w/full markings, pocket, and/or bookplate. Wear, soil. Size: 8vo. Ex-Library.

Paperback. Condition: Very Good. Dust Jacket Condition: No Dust Jacket. Lecture Notes in Computer Science 510; Ex-Library. Previous owner's sticker on the front cover. Ink stamp on half-title page. Small pen inscription on title page. Library catalogue sticker inside front cover. Faintly bumped spine head and rubbed corners. Foot of page block slightly grubby and marked due to age. Sound, clean book with tight binding. ADG. Ex-Library.

Paperback. Condition: Good. Dust Jacket Condition: No Dust Jacket. Lecture Notes in Computer Science 349. Ex-Library. Ink stamp and previous owner's stickers on the front cover, rubbing to the corners. Small pen marking to title page. Library catalogue sticker on colophon. Traces of sticker residue across spine foot; faintly bumped spine head and rubbed corners. Spine face and foot of page block slightly grubby and marked due to age. Sound, clean book with strong binding and bright text. ADG. Ex-Library.

Paperback. Condition: Good. . Satisfaction 100% guaranteed.

Condition: Very Good. Former library copy. Pages intact with possible writing/highlighting. Binding strong with minor wear. Dust jackets/supplements may not be included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condition: New. In.

Paperback. Condition: New.

Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.

Condition: Used. pp. 543.

Condition: Used. pp. 543.

Condition: Used. pp. 543.

Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Abstract interpretation of denotational definitions.- Temporal reasoning under generalized fairness constraints.- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples.- Some probabilistic powerdomains in the category SFP.- Ions and local definitions in logic programming.- Input sensitive, optimal parallel randomized algorithms for addition and identification.- A parallel statistical cooling algorithm.- Subgraph isomorphism for biconnected outerplanar graphs in cubic time.- Polynomial time algorithms for finding integer relations among real numbers.- New upperbounds for decentralized extrema-finding in a ring of processors.- Algorithms for visibility representations of planar graphs.- Speeding up random access machines by few processors.- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs.- On sparseness, ambiguity and other decision problems for acceptors and transducers.- Varietes de Semis Groupes et Mots Infinis.- Equations in free partially commutative monoids.- Separating and testing.- Decomposition de Fonctions Rationnelles.- Long unavoidable patterns.- Abstract implementations and correctness proofs.- Strictness and serializability.- Towards specification and proof of asynchronous systems.- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report).- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata.- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning -machines.- On sparse oracles separating feasible complexity classes.- On generalized kolmogorov complexity.- Area-time optimal division for T= ((logn)1+ ).- A time-spacetradeoff for element distinctness.- Parallel machines and their communication theoretical limits.

Condition: Good. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Ex-library, so some stamps and wear, but in good overall condition. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.

Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Abstract interpretation of denotational definitions.- Temporal reasoning under generalized fairness constraints.- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples.- Some probabilistic powerdomains in the category SFP.- Ions and local definitions in logic programming.- Input sensitive, optimal parallel randomized algorithms for addition and identification.- A parallel statistical cooling algorithm.- Subgraph isomorphism for biconnected outerplanar graphs in cubic time.- Polynomial time algorithms for finding integer relations among real numbers.- New upperbounds for decentralized extrema-finding in a ring of processors.- Algorithms for visibility representations of planar graphs.- Speeding up random access machines by few processors.- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs.- On sparseness, ambiguity and other decision problems for acceptors and transducers.- Varietes de Semis Groupes et Mots Infinis.- Equations in free partially commutative monoids.- Separating and testing.- Decomposition de Fonctions Rationnelles.- Long unavoidable patterns.- Abstract implementations and correctness proofs.- Strictness and serializability.- Towards specification and proof of asynchronous systems.- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report).- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata.- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning -machines.- On sparse oracles separating feasible complexity classes.- On generalized kolmogorov complexity.- Area-time optimal division for T= ((logn)1+ ).- A time-space tradeoff for element distinctness.- Parallel machines and their communication theoretical limits. 384 pp. Englisch, Französisch.

Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Abstract interpretation of denotational definitions.- Temporal reasoning under generalized fairness constraints.- Decidabilite de l egalite des Langages Algebriques Infinitaires Simples.- Some probabilistic powerdomains in the category SFP.- Ions and local .

Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Abstract interpretation of denotational definitions.- Temporal reasoning under generalized fairness constraints.- Decidabilite de l'egalite des Langages Algebriques Infinitaires Simples.- Some probabilistic powerdomains in the category SFP.- Ions and local definitions in logic programming.- Input sensitive, optimal parallel randomized algorithms for addition and identification.- A parallel statistical cooling algorithm.- Subgraph isomorphism for biconnected outerplanar graphs in cubic time.- Polynomial time algorithms for finding integer relations among real numbers.- New upperbounds for decentralized extrema-finding in a ring of processors.- Algorithms for visibility representations of planar graphs.- Speeding up random access machines by few processors.- Efficient algorithms for finding minimum spanning forests of hierarchically defined graphs.- On sparseness, ambiguity and other decision problems for acceptors and transducers.- Varietes de Semis Groupes et Mots Infinis.- Equations in free partially commutative monoids.- Separating and testing.- Decomposition de Fonctions Rationnelles.- Long unavoidable patterns.- Abstract implementations and correctness proofs.- Strictness and serializability.- Towards specification and proof of asynchronous systems.- Monotone boolean formulas, distributive lattices, and the complexities of logics, algebraic structures, and computation structures (preliminary report).- Concurrent conciseness of degree, probabilistic, nondeterministic and deterministic finite automata.- Logspace hierarchies, polynomial time and the complexity of fairness problems concerning -machines.- On sparse oracles separating feasible complexity classes.- On generalized kolmogorov complexity.- Area-time optimal division for T= ((logn)1+ ).- A time-spacetradeoff for element distinctness.- Parallel machines and their communication theoretical limits.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 384 pp. Englisch.