Texts in Theoretical Computer Science. An EATCS Series
Monographs in Theoretical Computer Science. An EATCS Series
Links for eMule (download books in PDF and DJVU formats for free)
Full list of volumes:
Texts in Theoretical Computer Science. An EATCS Series
- (1995) Structural Complexity I, 2nd Edition
- (1995) Models of Massive Parallelism. Analysis of Cellular Automata and Neural Networks
- (1996) Public-Key Cryptography
- (1997) The Resolution Calculus
- (1997) Communication Complexity and Parallel Computing
- (1997) Parsing Schemata. A Framework for Specification and Analysis of Parsing Algorithms
- (1998) DNA Computing. New Computing Paradigms
- (1999) Introduction to Circuit Complexity. A Uniform Approach
- (2000) Introduction to Process Algebra
- (2000) Computable Analysis. An Introduction
- (2001) Extremal Combinatorics. With Applications in Computer Science
- (2001) Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
- (2002) Information and Randomness. An Algorithmic Perspective
- (2002) Boolean Functions and Computation Models
- (2002) The Complexity Theory Companion
- (2004) Verification of Reactive Systems. Formal Methods and Algorithms
- (2004) The Parametric Lambda Calculus. A Metamodel for Computation
- (2004) Elements of Finite Model Theory
- (2004) Algorithmics for Hard Problems. Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics
- (2004) Interactive Theorem Proving and Program Development. Coq'Art: The Calculus of Inductive Constructions
- (2005) Universal Artificial Intelligence. Sequential Decisions Based on Algorithmic Probability
- (2005) Dissemination of Information in Communication Networks. Broadcasting, Gossiping, Leader Election, and Fault-Tolerance
- (2005) Abstract Computing Machines. A Lambda Calculus Perspective
- (2005) A Practical Theory of Reactive Systems. Incremental Modeling of Dynamic Behaviors
- (2005) Complexity Theory and Cryptology. An Introduction to Cryptocomplexity
- (2005) Design and Analysis of Randomized Algorithms. Introduction to Design Paradigms
- (2006) Grammatical Picture Generation. A Tree-Based Approach
- (2006) Parameterized Complexity Theory
- (2006) Software Engineering 3. Domains, Requirements, and Software Design
- (2006) Software Engineering 1. Abstraction and Modelling
- (2006) Software Engineering 2. Specification of Systems and Languages
- (2007) Finite Model Theory and Its Applications
- (2007) Modelling Distributed Systems
- (2008) Dissemination of Information in Optical Networks: From Technology to Algorithms
- (2008) Temporal Logic and State Systems
- (2008) Decision Procedures. An Algorithmic Point of View
- (2010) Graphs and Algorithms in Communication Networks. Studies in Broadband, Optical, Wireless and Ad Hoc Networks
- (2010) Exact Exponential Algorithms
- (2011) Theoretical Computer Science. Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography
- (2011) Extremal Combinatorics. With Applications in Computer Science
Link: http://www.springer.com/series/3214
Monographs in Theoretical Computer Science. An EATCS Series
(only the first 25 volumes were numbered)
- Volume 01 (1984) - Data Structures and Algorithms 1. Sorting and Searching
- Volume 02 (1984) - Data Structures and Algorithms 2. Graph Algorithms and NP-Completeness
- Volume 03 (1984) - Data Structures and Algorithms 3. Multi-dimensional Searching and Computational Geometr
- Volume 04 (1985) - Petri Nets. An Introduction
- Volume 05 (1986) - Semirings, Automata, Languages
- Volume 06 (1985) - Fundamentals of Algebraic Specification 1. Equations and Initial Semantics
- Volume 07 (1986) - Products of Automata
- Volume 08 (1987) - Temporal Logic of Programs
- Volume 09 (1987) - Computability - Klaus Weihrauch
- Volume 10 (1987) - Algorithms in Combinatorial Geometry
- Volume 11 (1988) - Structural Complexity I, 1st Edition
- Volume 12 (1988) - Rational Series and Their Languages
- Volume 13 (1988) - Nonsequential Processes. A Petri Net View
- Volume 14 (1988) - Confluent String Rewriting
- Volume 15 (1988) - Parsing Theory. Volume I. Languages and Parsing
- Volume 16 (1988) - Computing in Horn Clause Theories
- Volume 17 (1989) - The Structure of the Relational Database Model
- Volume 18 (1989) - Regulated Rewriting in Formal Language Theory
- Volume 19 (1990) - Compiler Generators. What They Can Do, What They Might Do, and What They Will Probably Never Do
- Volume 20 (1990) - Parsing Theory. Volume II. LR(k) and LL(k) Parsing
- Volume 21 (1990) - Fundamentals of Algebraic Specification 2. Module Specifications and Constraints
- Volume 22 (1990) - Structural Complexity II
- Volume 23 (1990) - Public-Key Cryptography
- Volume 24 (1991) - First-Order Programming Theories
- Volume 25 (1992) - Universal Algebra for Computer Scientists
- Volume ** (1992) - Specification and Analysis of Concurrent Systems
- Volume ** (1992) - Kolmogorov Complexity and Computational Complexity
- Volume ** (1992) - Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use, Volume 1 (1st Edition)
- Volume ** (1993) - Relations and Graphs. Discrete Mathematics for Computer Scientists
- Volume ** (1993) - Iteration Theories. The Equational Logic of Iterative Processes
- Volume ** (1994) - Information and Randomness. An Algorithmic Perspective
- Volume ** (1995) - The Logic of Partial Information
- Volume ** (1996) - Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 1 (2nd Edition)
- Volume ** (1995) - Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 2
- Volume ** (1997) - Coloured Petri Nets. Basic Concepts, Analysis Methods and Practical Use. Volume 3
- Volume ** (1998) - Syntax-Directed Semantics. Formal Models Based on Tree Transducers
- Volume ** (1999) - Finiteness and Regularity in Semigroups and Formal Languages
- Volume ** (2001) - Petri Net Algebra
- Volume ** (2002) - Process Algebra with Timing
- Volume ** (2002) - Incomplete Information: Structure, Inference, Complexity
- Volume ** (2003) - Theory of Semi-Feasible Algorithms
- Volume ** (2004) - Restricted-Orientation Convexity
- Volume ** (2004) - Semantic Integration of Heterogeneous Software Specifications
- Volume ** (2004) - Duration Calculus. A Formal Approach to Real-Time Systems
- Volume ** (2006) - Fundamentals of Algebraic Graph Transformation
- Volume ** (2007) - Theoretical Aspects of Local Search
- Volume ** (2008) - Logics of Specification Languages
- Volume ** (2008) - Unfoldings. A Partial-Order Approach to Model Checking
- Volume ** (2008) - Time-Dependent Scheduling
- Volume ** (2009) - Handbook of Weighted Automata
- Volume ** (2009) - Stochastic Coalgebraic Logic
- Volume ** (2011) - Deterministic Extraction from Weak Random Sources
- Volume ** (2011) - Theoretical Aspects of Distributed Computing in Sensor Networks
- Volume ** (2011) - Patterns in Permutations and Words
- Volume ** (2012) - Foundations of Algebraic Specification and Formal Software Development
- Volume ** (2012) - Modeling Time in Computing
- Volume ** (2013) - Fault-Tolerant Search Algorithms. Reliable Computation with Unreliable Information
Link: http://www.springer.com/series/776