Monographs and Texts

This is a series of monographs published by Springer-Verlag and launched during ICALP 1984; more than 30 volumes appeared over 10 years. The series includes monographs in all areas of theoretical computer science, such as the areas considered for ICALPs. Books published in this series present original research or material of interest to the research community and graduate students. Each volume is normally a uniform monograph rather than a compendium of articles. The series also contains high-level presentations of special topics. Nevertheless, as research and teaching usually go hand in hand, these volumes may still be useful as textbooks, too. Text published in this series are intended mostly for the graduate level. Typically, an undergraduate background in computer science is assumed. However, the background required may vary from topic to topic, and some books may be 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 will have examples and exercises.

	Monographs in Theoretical Computer Science. An EATCS Series Series Editors: Henzinger, M., Hromkovič, J., Nielsen, M., Rozenberg, G., Salomaa, A. Up to Vol 25 numbered. Up to May 1993 with the title: EATCS Monographs on Theoretical Computer Science ISSN: 1431-2654
	Models and Algorithms of Time-Dependent Scheduling Gawiejnowicz, Stanisław 2019
	Theory of Reversible Computing Morita, Kenichi 2017, XVII, 457 p.
	Process Algebras for Petri Nets Gorrieri, Roberto 2017, XIII, 302 p. 60 illus.
	Graph and Model Transformation Ehrig, H., Ermel, C., Golas, U., Hermann, F. 2015, XI, 472 p. 460 illus.
	Words and Graphs Kitaev, Sergey, Lozin, Vadim 2015, XVIII, 264 p. 137 illus.
	Fault-Tolerant Search Algorithms Cicalese, Ferdinando 2013, XV, 207 p. 14 illus.
	Modeling Time in Computing Furia, C.A., Mandrioli, D., Morzenti, A., Rossi, M. 2012, XVI, 423 p. 168 illus.
	Foundations of Algebraic Specification and Formal Software Development Sannella, Donald, Tarlecki, Andrzej 2012, XVI, 584 p.
	Patterns in Permutations and Words Kitaev, Sergey 2011, XXII, 494 p.
	Theoretical Aspects of Distributed Computing in Sensor Networks Nikoletseas, Sotiris, Rolim, José D.P. (Eds.) 2011, XXVI, 928p. 94 illus. in color.
	Deterministic Extraction from Weak Random Sources Gabizon, Ariel 2011, XII, 148 p.
	Stochastic Coalgebraic Logic Doberkat, Ernst-Erich 2009, XV, 231p. 162 illus., 81 illus. in color.
	Handbook of Weighted Automata Droste, Manfred, Kuich, Werner, Vogler, Heiko (Eds.) 2009, XVII, 608 p.
	Time-Dependent Scheduling Gawiejnowicz, Stanisław 2008, XVI, 377 pages with 26 illus.
	Unfoldings Esparza, Javier, Heljanko, Keijo 2008
	Logics of Specification Languages Bjørner, Dines, Henson, Martin C. (Eds.) 2008, XXII, 624 p.
	Theoretical Aspects of Local Search Michiels, Wil, Aarts, Emile, Korst, Jan 2007, VIII, 235 p. 70 illus.
	Fundamentals of Algebraic Graph Transformation Ehrig, H., Ehrig, K., Prange, U., Taentzer, G. 2006, XIII, 388 p. 41 illus.
	Duration Calculus Zhou, Chaochen, Hansen, Michael 2004, X, 250 p.
	Semantic Integration of Heterogeneous Software Specifications Große-Rhode, Martin 2004, IX, 330 p.
	Restricted-Orientation Convexity Fink, Eugene, Wood, Derick 2004, X, 102 p.
	Theory of Semi-Feasible Algorithms Hemaspaandra, Lane, Torenvliet, Leen 2003, X, 149 p.
	Incomplete Information: Structure, Inference, Complexity Demri, Stephane P., Orlowska, Ewa 2002, XVIII, 408 p.
	Process Algebra with Timing Baeten, J.C.M., Middelburg, C.A. 2002, XIX, 290 p.
	Petri Net Algebra Best, Eike, Devillers, Raymond, Koutny, Maciej 2001, XI, 380 p.
	Finiteness and Regularity in Semigroups and Formal Languages Luca, Aldo de, Varricchio, Stefano Softcover reprint of the original 1st ed. 1999, X, 240 pp.
	Syntax-Directed Semantics Formal Models Based on Tree Transducers Fülöp, Zoltan, Vogler, Heiko Softcover reprint of the original 1st ed. 1998, X, 269 pp., 74 figs.
	Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use Jensen, Kurt Softcover reprint of the original 1st ed. 1997, XI, 265 pp. 154 figs.
	Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use. Volume 1 Jensen, Kurt 2nd ed. 1996, XII, 236 p.
	The Logic of Partial Information Nait Abdallah, Areski Softcover reprint of the original 1st ed. 1995, XXV, 715p. 160 illus..
	Coloured Petri Nets Jensen, Kurt 1995, X, 174 pp. 34 figs.
	Information and Randomness Calude, Cristian Originally published in the series: "Monographs in Theoretical Computer Science. An EATCS Series" 1994, XVI, 243 p.
	Iteration Theories Bloom, Stephen L., Esik, Zoltan Softcover reprint of the original 1st ed. 1993, XV, 630 pp.
	Relations and Graphs Schmidt, Gunther, Ströhlein, Thomas Softcover reprint of the original 1st ed. 1993, IX, 301 pp. 203 figs.
	Coloured Petri Nets Basic Concepts, Analysis Methods and Practical Use, Volume 1 Jensen, Kurt 1992, X, 236 p.
	Universal Algebra for Computer Scientists Wechler, Wolfgang Softcover reprint of the original 1st ed. 1992, XII, 339 pp.
	Kolmogorov Complexity and Computational Complexity Watanabe, Osamu (Ed.) Softcover reprint of the original 1st ed. 1992, VII, 105 pp.
	Specification and Analysis of Concurrent Systems Basic Concepts, Analysis Methods and Practical Use, Volume 1 Jensen, Kurt 1992, X, 236 p.
	First-Order Programming Theories Gergely, Tamas, Ury, Laszlo 1991, IX, 353 p.
	Parsing Theory Sippu, Seppo, Soisalon-Soininen, Eljas 1990, IX, 427 p.
	Public-Key Cryptography Salomaa, Arto 1990, X, 247 p.
	Fundamentals of Algebraic Specification 2 Ehrig, Hartmut, Mahr, Bernd 1990, XI, 429 p.
	Compiler Generators Tofte, Mads 1990, XI, 146 pp.
	Structural Complexity II Balcazar, Jose L., Diaz, Josep, Gabarro, Joaquim Softcover reprint of the original 1st ed. 1990, IX, 283 pp. 72 figs.
	The Structure of the Relational Database Model Paredaens, J., De Bra, P., Gyssens, M., Gucht, D. van Softcover reprint of the original 1st ed. 1989, X, 233 p.
	Regulated Rewriting in Formal Language Theory Dassow, Jürgen, Paun, Gheorghe Softcover reprint of the original 1st ed. 1989, 308 pp. 15 figs., 4 tabs
	Parsing Theory I Sippu, Seppo, Soisalon-Soininen, Eljas 1988, VIII, 228 p.
	Confluent String Rewriting Jantzen, Matthias 1988, IX, 126 pp.
	Nonsequential Processes Best, Eike, Fernandez C., Cesar Softcover reprint of the original 1st ed. 1988, 44 figs. IX, 112 pages.
	Computing in Horn Clause Theories Padawitz, Peter Softcover reprint of the original 1st ed. 1988, XI, 322 pp. 7 figs.
	Structural Complexity I Balcazar, Jose L., Diaz, Josep, Gabarro, Joaquim 1988, IX, 191p. 57 illus..
	Rational Series and Their Languages Berstel, Jean, Reutenauer, Christophe Original French edition by Masson Editeur, Paris 1984 Softcover reprint of the original 1st ed. 1988, VIII, 151 pages.
	Algorithms in Combinatorial Geometry Edelsbrunner, Herbert 1987, XV, 423 p.
	Temporal Logic of Programs Kröger, Fred Softcover reprint of the original 1st ed. 1987, VIII, 148 pp.
	Computability Weihrauch, Klaus Softcover reprint of the original 1st ed. 1987, X, 517 pp.
	Products of Automata Gecseg, Ferenc Softcover reprint of the original 1st ed. 1986, 18 figs. VIII, 107 pages
	Semirings, Automata, Languages Kuich, W., Salomaa, A. Softcover reprint of the original 1st ed. 1986, IX, 374 pp. 23 figs.
	Fundamentals of Algebraic Specification 1 Ehrig, Hartmut, Mahr, Bernd 1985
	Petri Nets Reisig, Wolfgang Softcover reprint of the original 1st ed. 1985, X, 161 pp. 111 figs.
	Data Structures and Algorithms 1 Mehlhorn, K. Original German edition published by B.G. Teubner Verlag, 1977 Softcover reprint of the original 1st ed. 1984, XIV, 336 pp. 87 figs.
	Data Structures and Algorithms 3 Mehlhorn, K. Softcover reprint of the original 1st ed. 1984, XII, 284 pp. 134 figs.
	Data Structures and Algorithms 2 Mehlhorn, K. Softcover reprint of the original 1st ed. 1984, XII, 260 pp. 54 figs.

Monographs and Texts

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.