Texts in Theoretical Computer Science. An EATCS Series – serie

Formal Methods for Software Engineering

Languages, Methods, Application Domains

Formal Methods for Software Engineering

Languages, Methods, Application Domains

Introduction to Concurrency Theory

Transition Systems and CCS

Introduction to Concurrency Theory

Transition Systems and CCS

Introduction to Online Computation

Determinism, Randomization, Advice

Models of Computation

Simulation Algorithms for Computational Systems Biology

Introduction to Online Computation

Determinism, Randomization, Advice

Models of Computation

Simulation Algorithms for Computational Systems Biology

Verification of Reactive Systems

Formal Methods and Algorithms

Finite Model Theory and Its Applications

Dissemination of Information in Communication Networks

Broadcasting, Gossiping, Leader Election, and Fault-Tolerance

Theoretical Computer Science

Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography

Parametric Lambda Calculus

A Metamodel for Computation

Interactive Theorem Proving and Program Development

Coq’Art: The Calculus of Inductive Constructions

Abstract Computing Machines

A Lambda Calculus Perspective

Software Engineering 1

Abstraction and Modelling

Software Engineering 2

Specification of Systems and Languages

Software Engineering 3

Domains, Requirements, and Software Design

Elements of Finite Model Theory

Universal Artificial Intelligence

Sequential Decisions Based on Algorithmic Probability

Complexity Theory and Cryptology

An Introduction to Cryptocomplexity

Practical Theory of Reactive Systems

Incremental Modeling of Dynamic Behaviors

Design and Analysis of Randomized Algorithms

Introduction to Design Paradigms

Parameterized Complexity Theory

Information and Randomness

An Algorithmic Perspective

Algorithmics for Hard Problems

Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics

Communication Complexity and Parallel Computing