Foundations of Software Technology and Theoretical Computer Science
Format: Paperback
ISBN13: 9783540186250
Paperback|9783540186250
✨ Featured Offer
Brand New
$58.73
List Price: $54.99
🚚
See all 2 offers from $58.73 FREE standard delivery by: 30 Mar 2026
Overview
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.
| ISBN-13 | 9783540186250 |
|---|---|
| ISBN-10 | 3540186255 |
| Weight | 1.70 Pounds |
| Dimensions | 6.10 x 1.26 x 9.25 In |
| List Price | $54.99 |
| Edition | 1st Edition |
| Format | Paperback |
|---|---|
| Language | English |
| Pages | ix, 541 pages |
| Publisher | Springer |
| Published On | 1987-11-25 |
View All Offers
Sort by:
Price
Condition
Seller
Seller Comments
Price
✨ Brand New
Seller details
Alibris
Sparks, NV, USA
Print on demand Trade paperback (US). Glued binding. 541 p. Lecture Notes in Computer Science, 287.
Free delivery by: 30 Mar 2026
Used, Good
Seller details
Bonita
Santa Clarita, CA, USA
Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Free delivery by: 30 Mar 2026