Del 287 - Lecture Notes in Computer Science

Foundations of Software Technology and Theoretical Computer Science

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

Häftad, Engelska, 1987

Av Kesav V. Nori

739 kr

Beställningsvara. Skickas inom 7-10 vardagar

Fri frakt för medlemmar vid köp för minst 249 kr.

Produktinformation

Utgivningsdatum1987-11-25
Mått155 x 235 x 30 mm
Vikt832 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor541
Upplaga1987
FörlagSpringer-Verlag Berlin and Heidelberg GmbH & Co. KG
ISBN9783540186250

Tillhör följande kategorier

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

Del 472

Foundations of Software Technology and Theoretical Computer Science

Kesav V. Nori, C.E. Veni Madhavan, C. E. Veni Madhavan

739 kr

Foundations of Software Technology and Theoretical Computer Science

Del 241

Foundations of Software Technology and Theoretical Computer Science

739 kr

Foundations of Software Technology and Theoretical Computer Science

Del 560

Foundations of Software Technology and Theoretical Computer Science

Somenath Biswas, Kesav V. Nori

739 kr

Foundations of Software Technology and Theoretical Computer Science

Del 338

Foundations of Software Technology and Theoretical Computer Science

Kesav V. Nori, Sanjeev Kumar

739 kr

Lucia är död

Nyhet

Del 3

Lucia är död

Katarina Wennstam

259 kr299 kr

Historiens återkomst: Europa och världsordningens sammanbrott

Nyhet

Historiens återkomst: Europa och världsordningens sammanbrott

329 kr

Gränsöverskridaren

Nyhet

Del 6

Gränsöverskridaren

289 kr319 kr

Inte krig och inte fred

Nyhet

Del 4

Inte krig och inte fred

269 kr299 kr

Den yttersta hemligheten

Nyhet

Del 6

Den yttersta hemligheten

329 kr

Hitster Christmas

Hitster Christmas

Jumbo

259 kr