ABCD springer.com

Theoretical Computer Science Knowledge A Selection of Latest Research Visit springer.com for an extensive range of books and journals in the field

Theory of Computation Classical and Contemporary Approaches Topics and features include:  Organization into D. C. Kozen self-contained lectures of 3-7 pages  41 primary lectures and a handful of supplementary lectures Theory of Computation is a unique textbook that covering more specialized or advanced topics serves the dual purposes of covering core material in  12 homework sets and several miscellaneous the foundations of computing, as well as providing homework exercises of varying levels of difficulty, an introduction to some more advanced contempo- many with hints and complete solutions. rary topics. This innovative text focuses primarily, although by no means exclusively, on computational 2006. 335 p. 75 illus. (Texts in Computer Science) complexity theory. Hardcover ISBN 1-84628-297-7  $79.95

Theoretical Introduction to Programming

B. Mills page, this book takes you from a rudimentary under- standing of programming into the world of deep Including well-digested information about funda- technical software development. mental techniques and concepts in software construction, this book is distinct in unifying pure 2006. XI, 358 p. 29 illus. Softcover theory with pragmatic details. Driven by generic ISBN 1-84628-021-4  $69.95 problems and concepts, with brief and complete illustrations from languages including C, Prolog, Java, Scheme, Haskell and HTML. This book is intended to be both a how-to handbook and easy reference guide. Discussions of principle, worked Combines theory examples and exercises are presented. with practice Densely packed with explicit techniques on each springer.com Theoretical Computer Science Knowledge

Complexity Theory Exploring the Limits of Efficient Algorithms computer science. The topics selected have implica- I. Wegener tions for concrete applications, and the significance of complexity theory for today‘s computer science is This textbook considers randomization as a key stressed throughout. concept and emphasizes the interplay between theory and practice: 2005. XII, 308 p. 31 illus. Hardcover New branches of complexity theory continue to ISBN 3-540-21045-8  $64.95 arise in response to new algorithmic concepts, and its results - such as the theory of NP-completeness - have influenced the development of all areas of

Adapting Proofs-as-Programs The Curry-Howard Protocol I. H. Poernomo, J. N. Crossley, M. Wirsing art overview of the field and detailing tools and techniques to stimulate further research. This monograph details several important advances in the area known as the proofs-as-programs 2005. XII, 420 p. (Monographs in Computer Science) paradigm, a set of approaches to developing Hardcover programs from proofs in constructive logic. It ISBN 0-387-23759-3  $79.95 serves the dual purpose of providing a state-of-the-

Introduction to Reliable Distributed Programming

R. Guerraoui, L. Rodrigues running examples implemented in Java. These can be used by students to get a better understanding Guerraoui and Rodrigues present an introductory of how reliable distributed programming abstrac- description of fundamental reliable distributed tions can be implemented and used in practice. programming abstractions as well as algorithms to Combined, the chapters deliver a full course on reli- implement these abstractions. The authors follow able distributed programming. The book can also be an incremental approach by first introducing basic used as a complete reference on the basic elements abstractions in simple distributed environments, required to build reliable distributed applications. before moving to more sophisticated abstractions and more challenging environments. Each core 2006. XVIII, 314 p., 31 illus. Hardcover chapter is devoted to one specific class of abstrac- ISBN 3-540-28845-7  $59.95 tions, covering reliable delivery, shared memory, With set of running consensus and various forms of agreement. examples in Java This textbook comes with a companion set of

Software Engineering 1 Abstraction and Modelling refinement of requirements into software designs. D. Bjørner The volumes are suitable for self-study by prac- ticing software engineers and for use in university. The art, craft, discipline, logic, practice, and science Lecturers will be supported with a comprehensive of developing large-scale software products needs a guide to designing modules based on the textbooks, believable, professional base. The textbooks in this with solutions to many of the exercises presented, three-volume set combine informal, engineeringly and with a complete set of lecture slides. sound practice with the rigour of formal, math- ematics-based approaches.  Software Engineering 2. Specification of Systems and Volume 1 covers the basic principles and techniques Languages. 2006. 780 p. ISBN 3-540-21150-0 of formal methods abstraction and modelling.  Software Engineering 3. Domains, Requirements, Volume 2 covers the basic principles and techniques and Software Design. 2006. 780 p. ISBN 3-540-21151-9 For further EATCS volumes, of specifying systems and languages. please visit springer.com Volume 3 covers the process from the development 2006. XXXX, 714 p. 38 illus. (Texts in Theoretical of domain descriptions, via the derivation of require- Computer Science. An EATCS Series) Hardcover ments prescriptions from domain models, to the ISBN 3-540-21149-7  $89.95 Theoretical Computer Science Knowledge springer.com

Grammatical Picture Generation A Tree-Based Approach allows the reader to experiment with the picture F. Drewes generators explained in the text. The book is of interest to researchers and graduate students in This book introduces the reader to the notions, the computer science and mathematics who are engaged techniques, and the theory of grammatical picture with the theory and practice of picture-generating generation, a research field focusing on formal systems. systems that describe sets of pictures by means of syntactic rules. 2006. XII, 474 p. With CD-ROM. (Texts in Theo- In support, the book contains detailed exercises retical Computer Science. An EATCS Series) Hardcover throughout, and the software on the enclosed CD ISBN 3-540-21304-X  $89.95

Fundamentals of Algebraic Graph Transformation

H. Ehrig, K. Ehrig, U. Prange, G. Taentzer fields. This is the first textbook treatment of the algebraic approach to graph transformation, based Graphs are widely used to represent structural on algebraic structures and category theory. information in the form of objects and connec- tions between them. Graph transformation is the 2006. XIV, 388 p. 41 illus. (Monographs in Theoretical rule-based manipulation of graphs, an increasingly Computer Science. An EATCS Series) Hardcover important concept in computer science and related ISBN 3-540-31187-4  $84.95

Parameterized Complexity Theory

J. Flum, M. Grohe fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the This book is a state-of-the-art introduction into both reader is supported with exercises, notes, a detailed algorithmic techniques for fixed-parameter trac- index, and some background on complexity theory tability and the structural theory of parameterized and logic. complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in 2006. XIV, 493 p. 51 illus. (Texts in Theoretical Computer book form before. Several chapters each are devoted Science. An EATCS Series) Hardcover to intractability, algorithmic techniques for designing ISBN 3-540-29952-1  $89.95 fixed-parameter tractable algorithms, and bounded Important new results

Design and Analysis of Randomized Algorithms Introduction to Design Paradigms throughout, this text is a very effective and efficient J. Hromkovic introduction to this exciting field.

Introducing the fascinating world of randomness, Also available: Hromkovic et al., Dissemination of Infor- this book systematically teaches the main algorithm mation in Communication Networks. 2005. 275 p. design paradigms – foiling an adversary, abundance ISBN 3-540-00846-2 of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep 2005. XII, 284 p. 23 illus. (Texts in Theoretical insight into the nature of success in randomization. Computer Science. An EATCS Series) Hardcover Taking sufficient time to present motivations and to ISBN 3-540-23949-9  $49.95 develop the reader‘s intuition, while being rigorous

For all books and journals in the field, please visit springer.com Theoretical Computer Science Knowledge springer.com

A Practical Theory of Reactive Abstract Computing Machines Systems A Lambda Calculus Perspective Incremental Modeling of Dynamic Behaviors W. Kluge

R. Kurki-Suonio 2005. XIV, 384 p. 89 illus. (Texts in Theoretical Computer Science. An EATCS Series) Hardcover 2005. XXII, 418 p. 112 illus. (Texts in Theoretical ISBN 3-540-21146-2  $79.95 Computer Science. An EATCS Series) Hardcover ISBN 3-540-23342-3  $59.95

Universal Artificial Intelligence Verification of Reactive Systems Sequential Decisions Based on Algorithmic Formal Methods and Algorithms Probability K. Schneider M. Hutter 2004. XIV, 600 p. 149 illus. (Texts in Theoretical 2005. XX, 278 p. (Texts in Theoretical Computer Computer Science. An EATCS Series) Hardcover Science. An EATCS Series) Hardcover ISBN 3-540-00296-0  $79.95 ISBN 3-540-22139-5  $69.95

Biologically Inspired Algorithms for Financial Modelling

A. Brabazon, M. O’Neill market trading systems. Finally, Part III examines real-world case studies where BIA methodologies are In a detailed introduction, the authors explain employed to construct trading systems in equity and computer trading on financial markets and the foreign exchange markets, and for the prediction of difficulties faced in financial market modelling. corporate bond ratings and corporate failures. Then Part I provides a thorough guide to the various bioinspired methodologies - neural networks, 2006. XV, 269 p., 92 illus. (Natural Computing Series) evolutionary computing, particle swarm and ant Hardcover colony optimization, and immune systems. Part ISBN 3-540-26252-0  $84.95 II brings the reader through the development of

For more titles in the Nanotechnology: Science and Computation Natural Computing Series, please visit J. Chen, N. Jonoska, G. Rozenberg (Eds.) motors, DNA word design, molecular electronics, springer.com gene assembly, surface layer protein assembly, and This book offers a unique and authoritative perspec- membrane computing. tive on current research in nanoscale science, engi- neering and computing. Leading researchers cover 2006. XI, 391 p., 126 illus. (Natural Computing Series) the topics of DNA self-assembly in two-dimensional Hardcover arrays and three-dimensional structures, molecular ISBN 3-540-30295-6  $109.00

Applications of Membrane Computing

G. Ciobanu, M. J. Pérez-Jiménez, G. Paun (Eds.) detailed reviews of the software tools used to simu- late P systems. In dedicated chapters, leading experts explain most of the applications of membrane computing reported 2006. X, 441 p. (Natural Computing Series) Hardcover so far, in biology, computer science, computer ISBN 3-540-25017-4  $99.00 graphics and linguistics. The book also contains no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing springer.com Theoretical Computer Science Knowledge

Theoretical Computer Science Introduction to Automata, Computability, and the basic ideas of cryptography and interconnec- Complexity, Algorithmics, Randomization, tion network design. Communication, and Cryptography J. Hromkovic 2004. X, 313 p. (Texts in Theoretical Computer Science. An EATCS Series) Hardcover Juraj Hromkovic takes the reader on an elegant route ISBN 3-540-14015-8  $59.95 through the theoretical fundamentals of computer science. The author shows that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles. The book also presents the development of the computer scientist‘s way of Transparent thinking as well as fundamental concepts such as introduction to TCS ! approximation and randomization in algorithmics,

Grey Information Theory and Practical Applications grey statistical evaluations, grey systems modeling, S. Liu, Y. Lin grey combined models, grey prediction, grey deci- sions, grey programming, grey input and output and This book is a crystallization of the authors‘ work grey controls, etc. over the last twenty-five years. The book covers the latest advances in grey information and systems The book will be of interest to advanced students and research, providing a state-of-the-art overview of researchers in a wide range of fields. this important field. Covering the theoretical foundation, fundamental Examples of practical applications throughout, show methods and main topics in grey information how each idea, concept and theorem have been and systems research, this book includes all the applied to resolve a real-life problem. elementary concepts: basic principles, grey numbers Adaptable and their operations, grey equations and matrices, 2006. XVI, 504 p. 60 illus. (Advanced Information and self-instructional format operators of sequences and generations of grey Knowledge Processing) Hardcover sequences, grey incidence analysis, grey clusters and ISBN 1-85233-995-0  $99.00

A Theory of Distributed Objects Asynchrony - Mobility - Groups - Components siveness and determinism, and the potential of their D. Caromel, L. Henrio approach is further demonstrated by its capacity to cope with advanced issues such as mobility, groups, Distributed and communicating objects are and components. becoming ubiquitous. In global, Grid and Peer-to- Researchers and graduate students will find here an Peer computing environments, extensive use is made extensive review of concurrent languages and calculi, of objects interacting through method calls. So far, with comprehensive figures and summaries. no general formalism has been proposed for the Developers of distributed systems can adopt the foundation of such systems. many implementation strategies that are presented Caromel and Henrio are the first to define a calculus and analyzed in detail. for distributed objects interacting using asyn- chronous method calls with generalized futures, 2005. XXXII, 346 p. 114 illus. Hardcover providing both high structuring and low coupling. ISBN 3-540-20866-6  $69.95 The authors provide very generic results on expres-

Textbook For more information on textbook inspection copies visit “Services for Instructors” at springer.com

Book with CD-ROM no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing no.printing springer.com Theoretical Computer Science Knowledge

Complexity Theory and Cryptology An Introduction to Cryptocomplexity engineering, and can be used for courses on J. Rothe complexity theory and cryptology, preferably by stressing their interrelation. Moreover, it may serve Modern cryptology increasingly employs math- as a valuable source for researchers, teachers, and ematically rigorous concepts and methods from practitioners working in these fields. Starting from complexity theory. Conversely, current research scratch, it works its way to the frontiers of current topics in complexity theory are often motivated by research in these fields and provides a detailed questions and problems from cryptology. This book overview of their history and their current research takes account of this situation, and therefore its topics and challenges. subject is what may be dubbed “cryptocomplexity‘‘, a kind of symbiosis of these two areas. 2005. XI, 478 p. 63 illus. (Texts in Theoretical For further EATCS volumes, This book is written for undergraduate and graduate Computer Science. An EATCS Series) Hardcover please visit springer.com students of computer science, mathematics, and ISBN 3-540-22147-6  $59.95

Elements of Finite Model Theory

L. Libkin Libkin himself is a master of the art, and this shows in his beautiful presentation of the material. From the reviews  Model theory is the study of the  Ronald Fagin Manager, Foundations of Computer logical properties of mathematical structures. Finite Science, IBM Almaden Research Center, San Jose, CA model theory arises when we focus our attention on finite structures, such as finite graphs (graphs with 2004. XIV, 315 p. 24 illus. (Texts in Theoretical Computer a finite number of nodes). This book presents the Science. An EATCS Series) Hardcover most important results of finite model theory in an ISBN 3-540-21202-7  $54.95 extremely readable, yet careful and precise manner.

Order Now! Theoretical Computer Science Knowledge

For Convenient ordering  Call toll-free 1-800-SPRINGER  Email [email protected] Please mention Q2876 when ordering 8:30 am – 5:30 pm ET  Visit your local scientific/technical to guarantee listed prices.  Fax your order to (201) 348-4505 bookstore  Web springer.com  Use this convenient form

Yes, please send me Copies ISBN $ Copies ISBN $ Copies ISBN $ Copies ISBN $

Methods of Payment Check/Money Order enclosed AmEx MasterCard VISA

Card No. Exp. Date

Please send orders to: Subtotal: Name Springer Sales Tax: Address Order Department PO Box 2485 Shipping: Address Secaucus, NJ 07096-2485 TOTAL: (Sorry, we cannot deliver to P.O. boxes)

City / State / ZIP-Code CA, CO, MA, MO, NJ, and NY residents, please add sales tax. Canadian residents, please add 7% GST. Please add $5.00 for shipping one book and $1.00 for each additional book. Outside the US and Country Canada add $10.00 for first book, $5.00 for each additional book. All orders are processed upon receipt. If an order cannot be fufilled within 90 days, payment will be refunded upon request. Prices are payable in US currency or its equivalent. Remember, your 30-day return privilege is always guarantee. Telephone / Email

Outside the Americas:  Write: Springer Distribution Center GmbH, Haberstrasse 7, 69126 Heidelberg, Date Signature Germany  Call: + 49 (0) 6221-345-4301  Fax: +49 (0) 6221-345-4229  Web: springer.com  Email: [email protected] Q2876