Published by Springer-Verlag Berlin and Heidelberg GmbH & Co. K, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
Language: English
Seller: Ammareal, Morangis, France
Softcover. Condition: Bon. Ancien livre de bibliothèque. Edition 1985. Ammareal reverse jusqu'à 15% du prix net de cet article à des organisations caritatives. ENGLISH DESCRIPTION Book Condition: Used, Good. Former library book. Edition 1985. Ammareal gives back up to 15% of this item's net price to charity organizations.
Condition: new.
Paperback. Condition: Very Good. We are unable to ship to Canada at this time.038715650X Ex-library paperback in very nice condition with the usual markings and attachments.
Published by Berlin, Springer Berlin Heidelberg, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
Language: English
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. Ex-library with stamp and library-signature. GOOD condition, some traces of use. so7773 354015650X Sprache: Englisch Gewicht in Gramm: 900.
Condition: New. In.
Condition: New.
Seller: Chiron Media, Wallingford, United Kingdom
PF. Condition: New.
Published by Springer Berlin Heidelberg, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
Language: English
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - Vertex packing algorithms.- Linear and branching structures in the semantics and logics of reactive systems.- About rational sets of factors of a bi-infinite word.- A fair protocol for signing contracts.- The influence of key length on the area-time complexity of sorting.- Repeated synchronous snapshots and their implementation in CSP.- On total regulators generated by derivation relations.- Optimal solutions for a class of point retrieval problems.- Fractional cascading: A data structuring technique with geometric applications.- Hierarchies of one-way multihead automata languages.- Partitioning point sets in 4 dimensions.- A completeness theorem for recursively defined types.- Categorical combinatory logic.- Towards a uniform topological treatment of streams and functions on streams.- Infinite streams and finite observations in the semantics of uniform concurrency.- Imposed-functional dependencies inducing horizontal decompositions.- Characterization of high level tree transducers.- Ambiguity and transcendence.- A fast algorithm for polygon containment by translation.- Deterministic and Las Vegas primality testing algorithms.- Efficient algorithms for graphic matroid intersection and parity.- Operational semantics for order-sorted algebra.- A universal domain technique for profinite posets.- A simple proof of the Skolem-Mahler-Lech theorem.- On complete problems for NP CoNP.- An algebraic theory of fair asynchronous communicating processes.- Hoare's logic for nondeterministic regular programs: A nonstandard completeness theorem.- Powerdomains as algebraic lattices preliminary report.- Random generation of combinatiorial structures from a uniform distribution.- Do rational equivalence relations have regular cross-sections .- On probabilistic time and space.- The nearest neighbor problem on bounded domains.- Routing through a generalized switchbox.- On k-repetition free words generated by length uniform morphisms over a binary alphabet.- Every commutative quasirational language is regular.- A probabilistic distributed algorithm for set intersection and its analysis.- Distributed algorithms in synchronous broadcasting networks.- A context dependent equivalence between processes.- Lower bounds by kolmogorov-complexity.- A bidirectional shortest-path algorithm with good average-case behavior (preliminary version).- Applications of an infinite squarefree CO-CFL.- Special relations in automated deduction.- Dynamic interpolation search.- Polynomial levelability and maximal complexity cores.- Finite group topology and p-adic topology for free monoids.- On the use of relational expressions in the design of efficient algorithms.- The complementation problem for B¿chi automata with applications to temporal logic.- A complete compositional modal proof system for a subset of CCS.- On matrix multiplication using array processors.- Optimal parallel pattern matching in strings.- Compositionality and concurrent networks: Soundness and completeness of a proofsystem.
Published by Springer-Verlag GmbH, 1985
ISBN 10: 354015650X ISBN 13: 9783540156505
Language: English
Seller: preigu, Osnabrück, Germany
Taschenbuch. Condition: Neu. Automata, Languages and Programming | 12th Colloquium, Nafplion, Greece, July 15-19, 1985. Proceedings | Wilfried Brauer | Taschenbuch | xii | Englisch | 1985 | Springer-Verlag GmbH | EAN 9783540156505 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.