Foundations of Software Technology and Theoretical Computer Science

Seventh Conference, Pune, India, December 17-19, 1987. Proceedings

AvKesav V. Nori

Häftad, Engelska, 1987

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1987-11-25
Mått:155 x 235 x 30 mm
Vikt:832 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:541
Upplaga:1987
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540186250

Utforska kategorier

Innehållsförteckning

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.

Du kanske också är intresserad av

Foundations of Software Technology and Theoretical Computer Science

Kesav V. Nori, C.E. Veni Madhavan

Häftad, 1990

572 kr

Foundations of Software Technology and Theoretical Computer Science

Kesav V. Nori

Häftad, 1986

572 kr

Foundations of Software Technology and Theoretical Computer Science

Somenath Biswas, Kesav V. Nori

Häftad, 1991

572 kr

Foundations of Software Technology and Theoretical Computer Science

Kesav V. Nori, Sanjeev Kumar

Häftad, 1988

572 kr

Telecommunications Management for the Data Processing Executive

Milburn D. Smith, Unknown

Inbunden, 1987

1 084 kr

Open Covenant

Chris Bates Doob

Inbunden, 1987

843 kr

MetaSoft Primer

Andrzej Blikle, D. Barstow, W. Brauer, P. Brinch Hansen, D. Gries, D. Luckham, C. Moler, A. Pnueli, G. Seegmüller, J. Stoer, N. Wirth

Häftad, 1987

572 kr

Unesco Yearbook on Peace and Conflict Studies 1985

UNESCO, Unknown

Inbunden, 1987

913 kr

State Divided

Anne M. Ousterhout, Unknown

Inbunden, 1987

1 084 kr

As Nature Leads

J.A. Rogers

Häftad, 1987

179 kr

Foundations of Software Technology and Theoretical Computer Science

Seventh Conference, Pune, India, December 17-19, 1987. Proceedings

AvKesav V. Nori

Häftad, Engelska, 1987

Del i serien Lecture Notes in Computer Science

572 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Produktinformation

Utgivningsdatum:1987-11-25
Mått:155 x 235 x 30 mm
Vikt:832 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:541
Upplaga:1987
Förlag:Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN:9783540186250

Utforska kategorier

Innehållsförteckning

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.