Format:
Online-Ressource (IX, 539 S.)
Edition:
Online-Ausg. Berlin [u.a.] Springer 2006 Springer lecture notes archive
ISBN:
9783540480334
Series Statement:
Lecture notes in computer science 287
Content:
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.
Note:
Literaturangaben
Additional Edition:
ISBN 3540186255
Additional Edition:
ISBN 0387186255
Additional Edition:
ISBN 9783540186250
Additional Edition:
Erscheint auch als Druck-Ausgabe Foundations of software technology and theoretical computer science Berlin [u.a.] : Springer, 1987 ISBN 3540186255
Additional Edition:
ISBN 0387186255
Language:
English
Keywords:
Konferenzschrift
DOI:
10.1007/3-540-18625-5
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
URL:
Volltext
(lizenzpflichtig)
