Algorithms and Complexity / Edition 2

Algorithms and Complexity / Edition 2

0.0 0
by Gerard Meurant, J. Van Leeuwen
     
 

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

See more details below

Overview

This first part presents chapters on models of computation, complexity theory, data structures, and efficient computation in many recognized sub-disciplines of Theoretical Computer Science.

Product Details

ISBN-13:
9780444880710
Publisher:
Elsevier Science
Publication date:
09/28/1990
Pages:
1004

Table of Contents

Finite Automata (D. Perrin). Context-Free Languages (J. Berstel, L. Boasson). Formal Languages and Power Series (A. Salomaa). Automata on Infinite Objects (W. Thomas). Graph Rewriting: an Algebraic and Logic Approach (B. Courcelle). Rewrite Systems (N. Dershowitz, J.-P. Jouannaud). Functional Programming and Lambda Calculus (H.P. Barendregt). Type Systems for Programming Languages (J.C. Mitchell). Recursive Applicative Program Schemes (B. Courcelle). Logic Programming (K.R. Apt). Denotational Semantics (P.D. Mosses). Semantic Domains (G.A. Gunter, D.S. Scott). Algebraic Specification (M. Wirsing). Logics of Programs (D. Kozen, J. Tiuryn). Methods and Logics for Proving Programs (P. Cousot). Temporal and Modal Logic (E.A. Emerson). Elements of Relational Database Theory (P. Kanellakis). Distributed Computing: Models and Methods (L. Lamport, N. Lynch). Operational and Algebraic Semantics of Concurrent Processes (R. Milner). Subject Index.

Customer Reviews

Average Review:

Write a Review

and post it to your social network

     

Most Helpful Customer Reviews

See all customer reviews >