Skip to main content
main-content

Texts in Theoretical Computer Science. An EATCS Series

Texts in Theoretical Computer Science. An EATCS Series

On behalf of the European Association for Theoretical Computer Science (EATCS)

43 Jahrgänge | 1995 - 2017

Beschreibung

Texts published in this series are intended mostly for the graduate level. Typically, an undergraduate background in computer science will be assumed. However, the background required varies from topic to topic, and some books are self-contained. The texts cover both modern and classical areas with an innovative approach that may give them additional value as monographs. Most books in this series have examples and exercises.

Series Editors: Juraj Hromkovič (ETH Zürich), Mogens Nielsen (Aarhus University)

Advisory Board

: S. Albers, H. Attiya, G. Ausiello, M. Broy, C. Calude, A. Condon, A. Czumaj, P. Degano, J. Diaz, P. Gastin, G. Gottlob, D. Harel, J. Hartmanis, R. Heckel, L.A. Hemaspaandra, T. Henzinger, M. Hermenegildo, B. Jonsson, J. Karhumäki, L. Kari, M. Koutny, D. Kozen, T. Leighton, H. Lin, G. Mauri, D. Niwiński, C. Papadimitriou, D. Peleg, D. Sannella, U. Schöning, D. Scott, P.G. Spirakis, D. Wagner, E. Welzl, M. Wirsing

Founding Editors: W. Brauer, G. Rozenberg, A. Salomaa

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

2017 | Buch

Models of Computation

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. Each model is accompanied by relevant formal techniques for …

2017 | Buch

Simulation Algorithms for Computational Systems Biology

This book explains the state-of-the-art algorithms used to simulate biological dynamics. Each technique is theoretically introduced and applied to a set of modeling cases. Starting from basic simulation algorithms, the book also introduces more …

2016 | Buch

An Introduction to Online Computation

Determinism, Randomization, Advice

This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop …

2016 | Buch

Decision Procedures

An Algorithmic Point of View

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book …

2015 | Buch

Introduction to Concurrency Theory

Transition Systems and CCS

This book presents the fundamentals of concurrency theory with clarity and rigor. The authors start with the semantic structure, namely labelled transition systems, which provides us with the means and the tools to express processes, to compose th

2015 | Buch

Petri Net Synthesis

This book is a comprehensive, systematic survey of the synthesis problem, and of region theory which underlies its solution, covering the related theory, algorithms, and applications. The authors focus on safe Petri nets and place/transition nets

2011 | Buch

Extremal Combinatorics

With Applications in Computer Science

This book is a concise, self-contained, up-to-date introduction to extremal combinatorics for nonspecialists. There is a strong emphasis on theorems with particularly elegant and informative proofs, they may be called gems of the theory. The autho

2010 | Buch

Graphs and Algorithms in Communication Networks

Studies in Broadband, Optical, Wireless and Ad Hoc Networks

Algorithmic discrete mathematics plays a key role in the development of information and communication technologies, and methods that arise in computer science, mathematics and operations research – in particular in algorithms, computational comple

2010 | Buch

Exact Exponential Algorithms

For a long time computer scientists have distinguished between fast and slow algo rithms. Fast (or good) algorithms are the algorithms that run in polynomial time, which means that the number of steps required for the algorithm to solve a problem is

2008 | Buch

Temporal Logic and State Systems

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, unifor

2008 | Buch

Dissemination of Information in Optical Networks

From Technology to Algorithms In Cooperation with Ralf Klasing

Optical networks and the related technologies, network management software and services have undergone remarkable developments, and such networks are now the ultra-high-speed backbone networks for communication. Wavelength-Division Multiplexing (W

2008 | Buch

Decision Procedures

An Algorithmic Point of View

A decision procedure is an algorithm that, given a decision problem, terminates with a correct yes/no answer. Here, the authors focus on theories that are expressive enough to model real problems, but are still decidable. Specifically, the book co

2007 | Buch

Finite Model Theory and Its Applications

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. One of the fundamental insig

2007 | Buch

Modelling Distributed Systems

A distributed system is driven by separate components that are executed in parallel, and protocols for such systems form a major aspect of system design in today’s world of wireless and mobile networking. Process algebras are languages for the des

2006 | Buch

Parameterized Complexity Theory

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the dev

2006 | Buch

Software Engineering 1

Abstraction and Modelling

The art, craft, discipline, logic, practice, and science of developing large-scale software products needs a believable, professional base. The textbooks in this three-volume set combine informal, engineeringly sound practice with the rigour of fo

2006 | Buch

Grammatical Picture Generation

A Tree-Based Approach

Picturesareimportant,ineverydaylifeaswellasinart,engineering,andmost branches of the natural and social sciences. About three decades ago, the - servation that simple geometric processes often yield very complex geometric objects (i.e., pictures) gav

2006 | Buch

Software Engineering 3

Domains, Requirements, and Software Design

The art, craft, discipline, logic, practice, and science of developing large-scale software products needs a believable, professional base. The textbooks in this three-volume set combine informal, engineeringly sound practice with the rigour of fo

2006 | Buch

Software Engineering 2

Specification of Systems and Languages

The art, craft, discipline, logic, practice and science of developing large-scale software products needs a professional base. The textbooks in this three-volume set combine informal, engineeringly sound approaches with the rigor of formal, mathem

2005 | Buch

Universal Artificial Intelligence

Sequential Decisions Based on Algorithmic Probability

Personal motivation. The dream of creating artificial devices that reach or outperform human inteUigence is an old one. It is also one of the dreams of my youth, which have never left me. What makes this challenge so interesting? A solution would hav