9783540186250 - Foundations of Software Technology and Theoretical Computer Science: Seventh Conference, Pune, India, December 17-19, 1987. Proceedings: 287 di Nori, Kesav V. (12 risultati)

Condizione: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Condizione: New. In.

PF. Condizione: New.

Condizione: New. pp. 556.

Taschenbuch. Condizione: Neu. Druck auf Anfrage Neuware - Printed after ordering - Contents: Automata and Formal Languages.- Graph Algorithms & Geometric Algorithms.- Distributed Computing.- Parallel Algorithms.- Database Theory.- Logic Programming.- Programming Methodology.- Theory of Algorithms.- Software Technology.- Index of Authors.

Taschenbuch. Condizione: Neu. Foundations of Software Technology and Theoretical Computer Science | Seventh Conference, Pune, India, December 17-19, 1987. Proceedings | Kesav V. Nori | Taschenbuch | ix | Englisch | 1987 | Springer | EAN 9783540186250 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.

Paperback. Condizione: Very Good. Very Good. book.

Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -Contents: Automata and Formal Languages.- Graph Algorithms & Geometric Algorithms.- Distributed Computing.- Parallel Algorithms.- Database Theory.- Logic Programming.- Programming Methodology.- Theory of Algorithms.- Software Technology.- Index of Authors. 556 pp. Englisch.

Condizione: New. Print on Demand pp. 556 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.

Condizione: New. PRINT ON DEMAND pp. 556.

Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automata to the succinctness of their representation.- Automata, games, and p.

Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -Algebraic operational semantics.- On ambiguity of DTOL systems.- The equivalence problem for n-tape finite automata with simple cycles.- Relating the degree of ambiguity of finite automata to the succinctness of their representation.- Automata, games, and positive monadic theories of trees.- An algorithm for colouring perfect planar graphs.- Efficient algorithms for domination and Hamilton circuit problems on permutation graphs.- Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problem for classes of planar graphs.- Improved bounds for covering general polygons with rectangles.- Submodule construction as equation solving in CCS.- Computations in undistinguished networks.- A distributed algorithm to implement n-party rendezvous.- Merge and termination in process algebra.- Parallelism and programming: A perspective.- On optimal parallelization of sorting networks.- Parallel algorithms for approximate edge colouring of simple graphs.- An optimal randomized routing algorithm for the Mesh and a class of efficient Mesh-like routing networks.- An O(n2) algorithm for fan-out free query optimization.- Weak consistency of read-only transactions: A tool to improve concurrency in heterogeneous locking protocols.- Optimizing join queries in distributed databases.- Reasoning in systems of equations and inequations.- Specification=program+types.- Paraconsistent logic programming.- Semantics of distributed Horn clause programs.- The calculus of constructions : State of the art.- Modules for re-use.- Hierarchical refinement of A Z specification.- Lazy pattern matching in the ML language.- Program development using lambda abstraction.- Relativized Arthur-Merlin versus Merlin-Arthur games.- Probabilistic quantifiers vs. distrustful adversaries.- On certain bandwidth restricted versions of the satisfiability problem of propositional CNF formulas.- A look-ahead interpreter for sequential Prolog and its implementation.- Extension of weakest precondition formalism to a low level language.- Retrospection on the PQCC compiler structure.- Some recent applications of knowledge.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 556 pp. Englisch.