Bücher der Reihe Texts in Theoretical Computer Science. An EATCS Series

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

Extremal Combinatorics provides a concise, up-to-date introduction to extremal combinatorics for nonspecialists. The text emphasizes theorems with particularly elegant and informative proofs, and presents a wide range of combinatorial tools.

The final installment in this three-volume set is based on this maxim: "Before software can be designed its requirements must be well understood, and before the requirements can be expressed properly the domain of the application must be well understood."

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory.

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.

Theory and practice are often thought of as two di?erent worlds, governed bydi?erentideals,principles, andlaws.DavidLorgeParnas, forinstance,who hascontributedmuchtoourtheoreticalunderstandingofsoftwareengineering and also to sound use of theory in the practice of it, likes to point out that 'theoretically' is synonymous to 'not really'.

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.

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.

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

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.

In Cooperation with Ralf Klasing

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.

This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques.

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.