Bøger i Texts in Theoretical Computer Science. An EATCS Series serien

An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.

Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech nologies.

In Cooperation with Ralf Klasing

The book contains a completely new presentation of classical results in the field of Lambda Calculus, together with new results. The text is unique in that it presents a new calculus (Parametric Lambda Calculus) which can be instantiated to obtain already known lambda-calculi.

This textbook on decision procedure has been used to teach undergraduate and graduate courses at ETH Zurich and at the Technion, Haifa. The authors focus on theories that are expressive enough to model real problems, but are still decidable.

Temporal logic has developed over the last 30 years into a powerful formal setting for the specification and verification of state-based systems. Based on university lectures given by the authors, this book is a comprehensive, concise, uniform, up-to-date presentation of the theory and applications of linear and branching time temporal logic;

Finally, the book presents techniques for interpreter and compiler development of functional, imperative, modular and parallel programming languages. This book is targeted at late undergraduate to early graduate university students, and researchers of programming methodologies.

The book emphasizes the design of full-fledged, fully normalizing lambda calculus machinery, as opposed to the just weakly normalizing machines.

The art, craft, discipline, logic, practice, and science of developing large-scale software products needs a believable, professional base.

Emphasizes the computer science aspects of the subject. Details applications in databases, complexity theory, and formal languages, as well as other branches of computer science.

A practical introduction to the development of proofs and certified programs using Coq. An invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.

Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid fundament for studying various aspects of computability and complexity in analysis.

This book is a state-of-the-art introduction into both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes.

Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.

The History of the Book In August 1992 the author had the opportunity to give a course on resolution theorem proving at the Summer School for Logic, Language, and Information in Essex. It was the purpose of the course mentioned above to present such new developments of resolution theory.

A solution would have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. The goal of AI systems should be to be useful to humans.

Examining communication networks from a mathematical perspective, this volume offers an introductory overview of broadband, optical, wireless and ad hoc networks. Particular topics of interest are design, optimization, robustness and energy consumption.

Cryptography, secret writing, is enjoying a scientific renaissance following the seminal discovery in 1977 of public-key cryptography and applications in computers and communications.

Systematically teaches key paradigmic algorithm design methodsProvides a deep insight into randomization

This is the first book on DNA computing, a molecular approach that may revolutionize computing-replacing silicon with carbon and microchips with DNA molecules. The book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory.

" The vigorous growth in the study of algorithmic information theory has continued during the past few years, which is clearly visible in the present second edition.