Books in the Texts in Theoretical Computer Science. An EATCS Series series

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 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.

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.

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

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.

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

This book presents in their basic form the most important models of computation, their basic programming paradigms, and their mathematical descriptions, both concrete and abstract.

Starting from basic simulation algorithms, the book also introduces more advanced techniques that support delays, diffusion in space, or that are based on hybrid simulation strategies.This is a valuable self-contained resource for graduate students and practitioners in computer science, biology and bioinformatics.