Texts in Theoretical Computer Science (An EATCS Series)

The editors of the series are W. Brauer (Munich), G. Rozenberg (Leiden), and A. Salomaa (Turku). Potential authors should contact one of the editors. The advisory board consists of G. Ausiello (Rome), S. Even (Haifa), J. Hartmanis (Ithaca), N. Jones (Copenhagen), M. Nivat (Paris), C. Papadimitriou (Athens and San Diego), and D. Scott (Pittsburgh).

EATCS Monographs and Texts is a very important EATCS activity and its success depends largely on our members. If you are a potential author or know one please contact one of the editors.

An EATCS member can purchase books from the series with 25% discount. Your order should be sent to:

Prof. Dr. G. Rozenberg,
Dept. of Mathematics and Computer Science, University of Leiden,
P.O. Box 9512, 2300 RA Leiden,
The Netherlands.
Fax: +31 71 5276985
Email: This e-mail address is being protected from spambots. You need JavaScript enabled to view it

who after acknowledging your EATCS membership forwards the order for further processing to Springer Verlag -- they handle the whole matter further on.

Updated information about the series can be obtained from the publisher, Springer-Verlag.

	Texts in Theoretical Computer Science. An EATCS Series Series Editors: Henzinger, M., Hromkovič, J., Nielsen, M., Rozenberg, G., Salomaa, A. ISSN: 1862-4499
	Simulation Algorithms for Computational Systems Biology Marchetti, Luca, Priami, Corrado, Thanh, Vo Hong 2017
	Models of Computation Bruni, Roberto, Montanari, Ugo 2017
	Decision Procedures An Algorithmic Point of View Kroening, Daniel, Strichman, Ofer 2016
	An Introduction to Online Computation Determinism, Randomization, Advice Komm, Dennis 2016
	Petri Net Synthesis Badouel, Eric, Bernardinello, Luca, Darondeau, Philippe 2015
	Introduction to Concurrency Theory Transition Systems and CCS Gorrieri, Roberto, Versari, Cristian 2015
	Extremal Combinatorics With Applications in Computer Science Jukna, Stasys 2011
	Theoretical Computer Science Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography Hromkovič, Juraj 2011
	Exact Exponential Algorithms Fomin, Fedor V., Kratsch, Dieter 2010
	Graphs and Algorithms in Communication Networks Studies in Broadband, Optical, Wireless and Ad Hoc Networks Koster, Arie, Muñoz, Xavier (Eds.) 2010
	Decision Procedures An Algorithmic Point of View Kroening, Daniel, Strichman, Ofer 2008
	Temporal Logic and State Systems Kröger, Fred, Merz, Stephan 2008
	Dissemination of Information in Optical Networks: From Technology to Algorithms Bandyopadhyay, Subir 2008
	Modelling Distributed Systems Fokkink, Wan 2007
	Finite Model Theory and Its Applications Grädel, E. (et al.) 2007
	Software Engineering 2 Specification of Systems and Languages Bjørner, Dines 2006
	Software Engineering 1 Abstraction and Modelling Bjørner, Dines 2006
	Software Engineering 3 Domains, Requirements, and Software Design Bjørner, Dines 2006
	Parameterized Complexity Theory Flum, J., Grohe, M. 2006
	Grammatical Picture Generation A Tree-Based Approach Drewes, Frank 2006
	Design and Analysis of Randomized Algorithms Introduction to Design Paradigms Hromkovic, J. 2005
	Complexity Theory and Cryptology An Introduction to Cryptocomplexity Rothe, Jörg 2005
	A Practical Theory of Reactive Systems Incremental Modeling of Dynamic Behaviors Kurki-Suonio, R. 2005
	Abstract Computing Machines A Lambda Calculus Perspective Kluge, Werner 2005
	Dissemination of Information in Communication Networks Broadcasting, Gossiping, Leader Election, and Fault-Tolerance Hromkovič, J., Klasing, R., Pelc, A., Ruzicka, P., Unger, W. 2005
	Universal Artificial Intelligence Sequential Decisions Based on Algorithmic Probability Hutter, Marcus 2005
	Interactive Theorem Proving and Program Development Coq’Art: The Calculus of Inductive Constructions Bertot, Yves, Castéran, Pierre 2004
	Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics Hromkovič, Juraj 2004
	Elements of Finite Model Theory Libkin, Leonid 2004
	The Parametric Lambda Calculus A Metamodel for Computation Ronchi Della Rocca, Simona, Paolini, Luca 2004
	Verification of Reactive Systems Formal Methods and Algorithms Schneider, Klaus 2004
	The Complexity Theory Companion Hemaspaandra, Lane, Ogihara, Mitsunori 2002
	Boolean Functions and Computation Models Clote, Peter, Kranakis, Evangelos 2002
	Information and Randomness An Algorithmic Perspective Calude, Cristian S. 2002
	Algorithmics for Hard Problems Introduction to Combinatorial Optimization, Randomization, Approximation, and Heuristics Hromkovič, Juraj 2001
	Extremal Combinatorics With Applications in Computer Science Jukna, Stasys 2001
	Computable Analysis An Introduction Weihrauch, Klaus 2000
	Introduction to Process Algebra Fokkink, Wan 2000
	Introduction to Circuit Complexity A Uniform Approach Vollmer, Heribert 1999
	DNA Computing New Computing Paradigms Paun, Gheorghe, Rozenberg, Grzegorz, Salomaa, Arto 1998
	Parsing Schemata A Framework for Specification and Analysis of Parsing Algorithms Sikkel, Klaas 1997
	Communication Complexity and Parallel Computing Hromkovič, Juraj 1997
	The Resolution Calculus Leitsch, Alexander 1997
	Public-Key Cryptography Salomaa, Arto 1996
	Models of Massive Parallelism Analysis of Cellular Automata and Neural Networks Garzon, Max 1995
	Structural Complexity I Balcazar, Jose L., Diaz, Josep, Gabarro, Joaquim 1995

Texts in Theoretical Computer Science (An EATCS Series)

We use cookies to improve our website and your experience when using it. Cookies used for the essential operation of the site have already been set.