Foundations of Software Technology and Theoretical Computer Science - nouveau livre

EAN (ISBN-13): 9783540480334
Editeur: Springer Science+Business Media

Livre dans la base de données depuis 2017-01-15T10:01:53+01:00 (Zurich)
Page de détail modifiée en dernier sur 2018-05-17T01:00:22+02:00 (Zurich)
ISBN/EAN: 9783540480334

ISBN - Autres types d'écriture:
978-3-540-48033-4
Autres types d'écriture et termes associés:
Titre du livre: software, technology technology, foundations science

---

Données de l'éditeur

Auteur: Kesav V. Nori
Titre: Lecture Notes in Computer Science; Foundations of Software Technology and Theoretical Computer Science - Seventh Conference, Pune, India, December 17-19, 1987. Proceedings
Editeur: Springer; Springer Berlin
541 Pages
Date de parution: 2005-07-14
Berlin; Heidelberg; DE
Langue: Anglais
53,49 € (DE)
55,00 € (AT)
59,00 CHF (CH)
Available
IX, 541 p.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Software Engineering; Verstehen; Algorithms; Automat; algorithm; automata; computer; distributed computing; formal language; logic; programming; algorithm analysis and problem complexity; C; Software Engineering; Computer System Implementation; Programming Techniques; Algorithms; Theory of Computation; Computer Science; Systemanalyse und -design; Computerprogrammierung und Softwareentwicklung; Algorithmen und Datenstrukturen; Theoretische Informatik; BC

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.