{"title":"Texts In Theoretical Computer Science An Eatcs Series","description":"\u003cp\u003eDelve into the complex and fascinating world of theoretical computer science with this essential series. Perfect for students and researchers alike, explore the foundational texts shaping modern computing.\u003c\/p\u003e","products":[{"product_id":"complexity-theory-companion-book-lane-a-hemaspaandra-9783540674191","title":"The Complexity Theory Companion","description":"The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.   The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields.    This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49532518465809,"sku":"GOR013494516","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"US \/ GOOD \/ SBYB","offer_id":50404299637009,"sku":"CIN3540674195G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52128762429713,"sku":"NLS9783540674191","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540674195.jpg?v=1751189973"},{"product_id":"decision-procedures-book-daniel-kroening-9783540741046","title":"Decision Procedures","description":"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 concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.    The authors introduce the basic terminology of satisfiability modulo theories and then, in separate chapters, study decision procedures for each of the following theories: propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories and dedicate a chapter to modern techniques based on an interplay between a SAT solver and a decision procedure for the investigated theory.   This textbook has been used to teach undergraduate and graduate courses at ETH Zurich, at the Technion, Haifa, and at the University of Oxford. Each chapter includes a detailed bibliography and exercises. Lecturers' slides and a C++ library for rapid prototyping of decision procedures are available from the authors' website.","brand":"WoB","offers":[{"title":"GB \/ LIKE_NEW \/ INTERNAL","offer_id":49532696822033,"sku":"GOR013621006","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52487482638609,"sku":"NLS9783540741046","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761637421329,"sku":"NIN9783540741046","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540741046.jpg?v=1751064990"},{"product_id":"boolean-functions-and-computation-models-book-peter-clote-9783540594369","title":"Boolean Functions and Computation Models","description":"The foundations of computational complexity theory go back to Alan Thring in the 1930s who was concerned with the existence of automatic procedures deciding the validity of mathematical statements. The first example of such a problem was the undecidability of the Halting Problem which is essentially the question of debugging a computer program: Will a given program eventu­ ally halt? Computational complexity today addresses the quantitative aspects of the solutions obtained: Is the problem to be solved tractable? But how does one measure the intractability of computation? Several ideas were proposed: A. Cobham [Cob65] raised the question of what is the right model in order to measure a \"computation step\" , M. Rabin [Rab60] proposed the introduction of axioms that a complexity measure should satisfy, and C. Shannon [Sha49] suggested the boolean circuit that computes a boolean function. However, an important question remains: What is the nature of computa­ tion? In 1957, John von Neumann [vN58] wrote in his notes for the Silliman Lectures concerning the nature of computation and the human brain that . . . logics and statistics should be primarily, although not exclusively, viewed as the basic tools of 'information theory'. Also, that body of experience which has grown up around the planning, evaluating, and coding of complicated logical and mathematical automata will be the focus of much of this information theory. The most typical, but not the only, such automata are, of course, the large electronic computing machines.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":49575526629649,"sku":"GOR013749986","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52482989687057,"sku":"NLS9783540594369","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540594361.jpg?v=1751253032"},{"product_id":"modelling-distributed-systems-book-wan-fokkink-9783540739371","title":"Modelling Distributed Systems","description":"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 todays world of wireless and mobile networking.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ GARDNERS","offer_id":49737827287313,"sku":"NGR9783540739371","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52666897072401,"sku":"NLS9783540739371","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/B01LQDJNT8.jpg?v=1750999671"},{"product_id":"simulation-algorithms-for-computational-systems-biology-book-luca-marchetti-9783319631110","title":"Simulation Algorithms for Computational Systems Biology","description":"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 advanced techniques that support delays, diffusion in space, or that are based on hybrid simulation strategies.  This is a valuable self-contained resource for graduate students and practitioners in computer science, biology and bioinformatics. An appendix covers the mathematical background, and the authors include further reading sections in each chapter.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ GARDNERS","offer_id":49738408755473,"sku":"NGR9783319631110","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52476584296721,"sku":"NLS9783319631110","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/331963111X.jpg?v=1751030785"},{"product_id":"formal-methods-for-software-engineering-book-markus-roggenbach-9783030388027","title":"Formal Methods for Software Engineering","description":"Software programs are formal entities with precise meanings independent of their programmers, so the transition from ideas to programs necessarily involves a formalisation at some point.    The first part of this graduate-level introduction to formal methods develops an understanding of what constitutes formal methods and what their place is in Software Engineering. It also introduces logics as languages to describe reasoning and the process algebra CSP as a language to represent behaviours. The second part offers specification and testing methods for formal development of software, based on the modelling languages CASL and UML. The third part takes the reader into the application domains of normative documents, human machine interfaces, and security.  Use of notations and formalisms is uniform throughout the book.    Topics and features:      Explains foundations, and      introduces specification, verification, and testing methods Exploresvarious application      domains Presents realistic and practical      examples, illustrating concepts   Brings together contributions      from highly experienced educators and researchers   Offers modelling and analysis      methods for formal development of software   Suitable for graduate and undergraduate courses in software engineering, this uniquely practical textbook will also be of value to students in informatics, as well as to scientists and practical engineers,  who want to learn about or work more effectively with formal theories and methods.    Markus Roggenbach is a Professor in the Dept. of Computer Science of Swansea University. Antonio Cerone is an Associate Professor in the Dept. of Computer Science of Nazarbayev University, Nur-Sultan. Bernd-Holger Schlingloff is a Professor in the Institut für Informatik of Humboldt-Universität zu Berlin. Gerardo Schneider is a Professor in the Dept. of Computer Science and Engineering of University of Gothenburg. Siraj Ahmed Shaikh is a Professor in the Institute for Future Transport and Cities of Coventry University.  The companion site for the book offers additional resources, including further material for selected chapters, prepared lab classes, a list of errata, slides and teaching material, and virtual machines with preinstalled tools and resources for hands-on experience with examples from the book. The URL is: https:\/\/sefm-book.github.io","brand":"WoB","offers":[{"title":"GB \/ NEW \/ GARDNERS","offer_id":49744314335505,"sku":"NGR9783030388027","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52677777981713,"sku":"NLS9783030388027","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3030388026.jpg?v=1750999065"},{"product_id":"theoretical-computer-science-book-juraj-hromkovi-9783540140153","title":"Theoretical Computer Science","description":"The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.   An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.","brand":"WoB","offers":[{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":50404130259217,"sku":"CIN3540140158VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52144820093201,"sku":"NLS9783540140153","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540140158.jpg?v=1750903712"},{"product_id":"computable-analysis-book-klaus-weihrauch-9783540668176","title":"Computable Analysis","description":"Is the exponential function computable? Are union and intersection of closed subsets of the real plane computable? Are differentiation and integration computable operators? Is zero finding for complex polynomials computable? Is the Mandelbrot set decidable? And in case of computability, what is the computational complexity? Computable analysis supplies exact definitions for these and many other similar questions and tries to solve them. - Merging fundamental concepts of analysis and recursion theory to a new exciting theory, this book provides a solid basis for studying various aspects of computability and complexity in analysis. It is the result of an introductory course given for several years and is written in a style suitable for graduate-level and senior students in computer science and mathematics. Many examples illustrate the new concepts while numerous exercises of varying difficulty extend the material and stimulate readers to work actively on the text.","brand":"WoB","offers":[{"title":"US \/ GOOD \/ SBYB","offer_id":50429032792337,"sku":"CIN3540668179G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52675747152145,"sku":"NLS9783540668176","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/B01CMUN64C.jpg?v=1750870556"},{"product_id":"extremal-combinatorics-book-stasys-jukna-9783642173639","title":"Extremal Combinatorics","description":"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 author presents a wide spectrum of the most powerful combinatorial tools together with impressive applications in computer science: methods of extremal set theory, the linear algebra method, the probabilistic method, and fragments of Ramsey theory. No special knowledge in combinatorics or computer science is assumed – the text is self-contained and the proofs can be enjoyed by undergraduate students in mathematics and computer science. Over 300 exercises of varying difficulty, and hints to their solution, complete the text.  This second edition has been extended with substantial new material, and has been revised and updated throughout. It offers three new chapters on expander graphs and eigenvalues, the polynomial method and error-correcting codes. Most of the remaining chapters also include new material, such as the Kruskal—Katona theorem on shadows, the Lovász—Stein theorem on coverings, large cliques in dense graphs without induced 4-cycles, a new lower bounds argument for monotone formulas, Dvir's solution of the finite field Kakeya conjecture, Moser's algorithmic version of the Lovász Local Lemma, Schöning's algorithm for 3-SAT, the Szemerédi—Trotter theorem on the number of point-line incidences, surprising applications of expander graphs in extremal number theory, and some other new results.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51061815050513,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51061817901329,"sku":"NIN9783642173639","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52660389970193,"sku":"NLS9783642173639","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642173632.jpg?v=1751383784"},{"product_id":"universal-artificial-intelligence-book-marcus-hutter-9783642060526","title":"Universal Artificial Intelligence","description":"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 have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. So, it's worth sticking to it for a lifetime, even if it takes 30 years or so to reap the benefits. The AI problem. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. A natural definition of a system is anything that has an input and an output stream. Intelligence is more complicated. It can have many faces like creativity, solving prob­ lems, pattern recognition, classification, learning, induction, deduction, build­ ing analogies, optimization, surviving in an environment, language processing, and knowledge. A formal definition incorporating every aspect of intelligence, however, seems difficult. Most, if not all known facets of intelligence can be formulated as goal driven or, more precisely, as maximizing some utility func­ tion. It is, therefore, sufficient to study goal-driven AI; e. g. the (biological) goal of animals and humans is to survive and spread. The goal of AI systems should be to be useful to humans.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51062297559313,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51062300410129,"sku":"NIN9783642060526","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52480938705169,"sku":"NLS9783642060526","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642060528.jpg?v=1753686406"},{"product_id":"complexity-theory-and-cryptology-book-jrg-rothe-9783642060540","title":"Complexity Theory and Cryptology","description":"Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51062305325329,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51062308241681,"sku":"NIN9783642060540","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52455342342417,"sku":"NLS9783642060540","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3642060544.jpg?v=1751126929"},{"product_id":"parameterized-complexity-theory-book-j-flum-9783540299523","title":"Parameterized Complexity Theory","description":"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 development of various new algorithmic techniques and a whole new theory of intractability.   This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.   The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51062600368401,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51062603153681,"sku":"NIN9783540299523","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52590532526353,"sku":"NLS9783540299523","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540299521.jpg?v=1751317995"},{"product_id":"decision-procedures-book-daniel-kroening-9783662570654","title":"Decision Procedures","description":"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 concentrates on decision procedures for first-order theories that are commonly used in automated verification and reasoning, theorem-proving, compiler optimization and operations research. The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.    The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework. Then, in separate chapters, they study decision procedures for propositional logic; equalities and uninterpreted functions; linear arithmetic; bit vectors; arrays; pointer logic; and quantified formulas. They also study the problem of deciding combined theories based on the Nelson-Oppen procedure.    Thefirst edition of this book was adopted as a textbook in courses worldwide. It was published in 2008 and the field now called SMT was then in its infancy, without the standard terminology and canonic algorithms it has now; this second edition reflects these changes. It brings forward the DPLL(T) framework. It also expands the SAT chapter with modern SAT heuristics, and includes a new section about incremental satisfiability, and the related Constraints Satisfaction Problem (CSP).  The chapter about quantifiers was expanded with a new section about general quantification using E-matching and a section about Effectively Propositional Reasoning (EPR). The book also includes a new chapter on the application of SMT in industrial software engineering and in computational biology, coauthored by Nikolaj Bjørner and Leonardo de Moura, and Hillel Kugler, respectively.    Each chapter includes a detailed bibliography and exercises. Lecturers’ slides and a C++ library for rapid prototyping of decision procedures are available from the authors’ website.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51062872441105,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51062875586833,"sku":"NIN9783662570654","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52481350369553,"sku":"NLS9783662570654","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3662570653.jpg?v=1750903323"},{"product_id":"design-and-analysis-of-randomized-algorithms-book-j-hromkovic-9783540239499","title":"Design and Analysis of Randomized Algorithms","description":"Randomness is a powerful phenomenon that can be harnessed to solve various problems in all areas of computer science. Randomized algorithms are often more efficient, simpler and, surprisingly, also more reliable than their deterministic counterparts. Computing tasks exist that require billions of years of computer work when solved using the fastest known deterministic algorithms, but they can be solved using randomized algorithms in a few minutes with negligible error probabilities.   Introducing the fascinating world of randomness, this book systematically teaches the main algorithm design paradigms – foiling an adversary, abundance of witnesses, fingerprinting, amplification, and random sampling, etc. – while also providing a deep insight into the nature of success in randomization. Taking sufficient time to present motivations and to develop the reader's intuition, while being rigorous throughout, this text is a very effective and efficient introduction to this exciting field.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51063544185105,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51063547101457,"sku":"NIN9783540239499","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52479728124177,"sku":"NLS9783540239499","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540239499.jpg?v=1750870534"},{"product_id":"introduction-to-circuit-complexity-book-heribert-vollmer-9783540643104","title":"Introduction to Circuit Complexity","description":"An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51064445927697,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":51064448254225,"sku":"NIN9783540643104","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52480518226193,"sku":"NLS9783540643104","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/1402060076.jpg?v=1750773977"},{"product_id":"interactive-theorem-proving-and-program-development-book-yves-bertot-9783540208549","title":"Interactive Theorem Proving and Program Development","description":"Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. It is based on a theory called the calculus of inductive constructions, a variant of type theory.   This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. With its large collection of examples and exercises it is an invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51326075830545,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":51326078189841,"sku":"CIN3540208542VG","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52151769923857,"sku":"NLS9783540208549","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ GOOD \/ INTERNAL","offer_id":53154682011921,"sku":"GOR014783769","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":53155885416721,"sku":"GOR007601168","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540208542.jpg?v=1751064957"},{"product_id":"dna-computing-book-gheorghe-paun-9783540641964","title":"DNA Computing","description":"This is the first book on DNA computing, a molecular approach that may revolutionize computing-replacing silicon with carbon and microchips with DNA molecules. The book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory. It then brings the reader to the most advanced theories develop thus far in this emerging research area.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51418197426449,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ GOOD \/ SBYB","offer_id":51418197983505,"sku":"CIN3540641963G","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52345903743249,"sku":"NLS9783540641964","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761624674577,"sku":"NIN9783540641964","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540641963.jpg?v=1751221361"},{"product_id":"elements-of-finite-model-theory-book-leonid-libkin-9783540212027","title":"Elements of Finite Model Theory","description":"Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech- nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel- ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de- velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es- sentially first-order predicate calculus or its minor extensions.","brand":"WoB","offers":[{"title":"- \/ - \/ -","offer_id":51430352814353,"sku":"","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":51430353043729,"sku":"GOR014272925","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52128481444113,"sku":"NLS9783540212027","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ VERY_GOOD \/ SBYB","offer_id":52815251505425,"sku":"CIN3540212027VG","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/3540212027.jpg?v=1751444951"},{"product_id":"universal-artificial-intelligence-book-marcus-hutter-9783540221395","title":"Universal Artificial Intelligence","description":"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 have enormous implications on our society, and there are reasons to believe that the AI problem can be solved in my expected lifetime. So, it's worth sticking to it for a lifetime, even if it takes 30 years or so to reap the benefits. The AI problem. The science of artificial intelligence (AI) may be defined as the construction of intelligent systems and their analysis. A natural definition of a system is anything that has an input and an output stream. Intelligence is more complicated. It can have many faces like creativity, solving prob- lems, pattern recognition, classification, learning, induction, deduction, build- ing analogies, optimization, surviving in an environment, language processing, and knowledge. A formal definition incorporating every aspect of intelligence, however, seems difficult. Most, if not all known facets of intelligence can be formulated as goal driven or, more precisely, as maximizing some utility func- tion. It is, therefore, sufficient to study goal-driven AI; e. g. the (biological) goal of animals and humans is to survive and spread. The goal of AI systems should be to be useful to humans.","brand":"WoB","offers":[{"title":"GB \/ VERY_GOOD \/ INTERNAL","offer_id":52082881954065,"sku":"GOR010069434","price":0.0,"currency_code":"GBP","in_stock":false},{"title":"GB \/ NEW \/ INGRAM","offer_id":52538559987985,"sku":"NLS9783540221395","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540221395.jpg?v=1756753185"},{"product_id":"parametric-lambda-calculus-book-simona-ronchi-della-rocca-9783540200321","title":"The Parametric Lambda Calculus","description":"The book contains a completely new presentation of classical results in the field of Lambda Calculus, together with new results. The text is unique in that it presents a new calculus (Parametric Lambda Calculus) which can be instantiated to obtain already known lambda-calculi. Some properties, which in the literature have been proved separately for different calculi, can be proved once for the Parametric one. The lambda calculi are presented from a Computer Science point of view, with a particular emphasis on their semantics, both operational and denotational.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52122068746513,"sku":"NLS9783540200321","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761646694673,"sku":"NIN9783540200321","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540200321.jpg?v=1757437321"},{"product_id":"decision-procedures-book-daniel-kroening-9783662504963","title":"Decision Procedures","description":"The techniques described in the book draw from fields such as graph theory and logic, and are routinely used in industry.The authors introduce the basic terminology of SAT, Satisfiability Modulo Theories (SMT) and the DPLL(T) framework.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52123146223889,"sku":"NLS9783662504963","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761908576529,"sku":"NIN9783662504963","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783662504963.jpg?v=1757447015"},{"product_id":"models-of-computation-book-roberto-bruni-9783319428987","title":"Models of Computation","description":"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.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52125450961169,"sku":"NLS9783319428987","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":53010829705489,"sku":"NIN9783319428987","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783319428987.jpg?v=1757465296"},{"product_id":"dissemination-of-information-in-communication-networks-book-a-pelc-9783540008460","title":"Dissemination of Information in Communication Networks","description":"Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents, severalbooksonparallelcomputingwerewritten. The involvedtextbookIntroductiontoParallelAlgorithmsandArchitecturesby F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality - the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation for writing this book.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52128406110481,"sku":"NLS9783540008460","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540008460.jpg?v=1757490643"},{"product_id":"finite-model-theory-and-its-applications-book-phokion-kolaitis-9783540004288","title":"Finite Model Theory and Its Applications","description":"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 insights of mathematical logic is that our understanding of mathematical phenomena is enriched by elevating the languages we use to describe mathematical structures to objects of explicit study. If mathematics is the science of patterns, then the media through which we discern patterns, as well as the structures in which we discern them, command our attention. It isthis aspect oflogicwhichis mostprominentin model theory,thebranchof mathematical logic which deals with the relation between a formal language and its interpretations. No wonder, then, that mathematical logic, and ?nite model theory in particular, should ?nd manifold applications in computer science: from specifying programs to querying databases, computer science is rife with phenomena whose understanding requires close attention to the interaction between language and structure. This volume gives a broadoverviewof some central themes of ?nite model theory: expressive power, descriptive complexity, and zero-one laws, together with selected applications to database theory and arti?cial intelligence, es- cially constraint databases and constraint satisfaction problems. The ?nal chapter provides a concise modern introduction to modal logic, which emp- sizes the continuity in spirit and technique with ?nite model theory.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52144124625169,"sku":"NLS9783540004288","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540004288.jpg?v=1757587524"},{"product_id":"parameterized-complexity-theory-book-j-flum-9783642067570","title":"Parameterized Complexity Theory","description":"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 development of various new algorithmic techniques and a whole new theory of intractability.   This book is a state-of-the-art introduction to both algorithmic techniques for fixed-parameter tractability and the structural theory of parameterized complexity classes, and it presents detailed proofs of recent advanced results that have not appeared in book form before. Several chapters are each devoted to intractability, algorithmic techniques for designing fixed-parameter tractable algorithms, and bounded fixed-parameter tractability and subexponential time complexity. The treatment is comprehensive, and the reader is supported with exercises, notes, a detailed index, and some background on complexity theory and logic.   The book will be of interest to computer scientists, mathematicians and graduate students engaged with algorithms and problem complexity.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52145876730129,"sku":"NLS9783642067570","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761795985681,"sku":"NIN9783642067570","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642067570.jpg?v=1757595566"},{"product_id":"information-and-randomness-book-cristian-s-calude-9783540434665","title":"Information and Randomness","description":"The first edition of the monograph Information and Randomness: An Algorithmic Perspective by Crist ian Calude was published in 1994. In my Foreword I said: The research in algorithmic information theory is already some 30 years old. However, only the recent years have witnessed a really vigorous growth in this area. . . . The present book by Calude fits very well in our series. Much original research is presented. . . making the approach richer in consequences than the classical one. Remarkably, however, the text is so self-contained and coherent that the book may also serve as a textbook. All proofs are given in the book and, thus, it is not necessary to consult other sources for classroom instruction.  The vigorous growth in the study of algorithmic information theory has continued during the past few years, which is clearly visible in the present second edition. Many new results, examples, exercises and open prob- lems have been added. The additions include two entirely new chapters: Computably Enumerable Random Reals and Randomness and Incom- pleteness. The really comprehensive new bibliography makes the book very valuable for a researcher. The new results about the characterization of computably enumerable random reals, as well as the fascinating Omega Numbers, should contribute much to the value of the book as a textbook. The author has been directly involved in these results that have appeared in the prestigious journals Nature, New Scientist and Pour la Science.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52327394902289,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52327395557649,"sku":"NLS9783540434665","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540434665.jpg?v=1758062368"},{"product_id":"modelling-distributed-systems-book-wan-fokkink-9783642093210","title":"Modelling Distributed Systems","description":"This textbook guides students through algebraic specification and verification of distributed systems, and some of the most prominent formal verification techniques. Full solutions are provided in an appendix, while exercise sheets, lab exercises, example specifications and lecturer slides are available on the author's website.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52332727533841,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52332728123665,"sku":"NLS9783642093210","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642093210.jpg?v=1758152519"},{"product_id":"temporal-logic-and-state-systems-book-stephan-merz-9783642086809","title":"Temporal Logic and State Systems","description":"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, uniform, up-to-date presentation of the theory and applications of linear and branching time temporal logic; TLA (Temporal Logic of Actions); automata theoretical connections; model checking; and related theories.    All theoretical details and numerous application examples are elaborated carefully and with full formal rigor, and the book will serve as a basic source and reference for lecturers, graduate students and researchers.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52332748046609,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52332748669201,"sku":"NLS9783642086809","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642086809.jpg?v=1758152579"},{"product_id":"dissemination-of-information-in-optical-networks-book-subir-bandyopadhyay-9783642091971","title":"Dissemination of Information in Optical Networks:","description":"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 (WDM), the ability to support multiple communication pathways over the same fiber, enables efficient use of the enormous capability for data communication of optical networks.    This book gives a broad overview of techniques used in the design of WDM networks for efficient dissemination of information in computer networks. It starts with an overview of the hardware components, then provides a thorough review of WDM, wavelength-routed networks, algorithms for route and wavelength assignment, design of broadcast and select networks, logical topology design, and techniques to handle faults and algorithms for efficient use of optical networks. Each topic has been covered rigorously with emphasis on detailed explanations of the approaches used, starting from the fundamentals up to the state of the art. The optimization techniques covered in the book include graph-theoretic algorithms, mixed-integer linear programming and heuristics.    The book is intended for beginners as well as for specialists, and the reader should be able to design WDM networks and follow developments in the field. Each chapter contains a detailed, annotated bibliography. There are numerous exercises for the reader to test understanding of the subject, while readers unfamiliar with mathematical programming techniques and network flow optimization are offered short, easy-to-understand appendices at the end of the book.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52332760006929,"sku":"NLS9783642091971","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642091971.jpg?v=1758152612"},{"product_id":"introduction-to-process-algebra-book-wan-fokkink-9783540665793","title":"Introduction to Process Algebra","description":"Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52333827555601,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52333828243729,"sku":"NLS9783540665793","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540665793.jpg?v=1758155641"},{"product_id":"communication-complexity-and-parallel-computing-book-juraj-hromkovi-9783540574590","title":"Communication Complexity and Parallel Computing","description":"The communication complexity of two-party protocols is an only 15 years old complexity measure, but it is already considered to be one of the fundamen- tal complexity measures of recent complexity theory. Similarly to Kolmogorov complexity in the theory of sequential computations, communication complex- ity is used as a method for the study of the complexity of concrete computing problems in parallel information processing. Especially, it is applied to prove lower bounds that say what computer resources (time, hardware, memory size) are necessary to compute the given task. Besides the estimation of the compu- tational difficulty of computing problems the proved lower bounds are useful for proving the optimality of algorithms that are already designed. In some cases the knowledge about the communication complexity of a given problem may be even helpful in searching for efficient algorithms to this problem. The study of communication complexity becomes a well-defined indepen- dent area of complexity theory. In addition to a strong relation to several funda- mental complexity measures (and so to several fundamental problems of com- plexity theory) communication complexity has contributed to the study and to the understanding of the nature of determinism, nondeterminism, and random- ness in algorithmics. There already exists a non-trivial mathematical machinery to handle the communication complexity of concrete computing problems, which gives a hope that the approach based on communication complexity will be in- strumental in the study of several central open problems of recent complexity theory.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52392628420881,"sku":"NLS9783540574590","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540574590.jpg?v=1758579917"},{"product_id":"parsing-schemata-book-klaas-sikkel-9783642644511","title":"Parsing Schemata","description":"Parsing, the syntactic analysis of language, has been studied extensively in computer science and computational linguistics. Computer programs and natural languages share an underlying theory of formal languages and require efficient parsing algorithms. This introduction reviews the theory of parsing from a novel perspective. It provides a formalism to capture the essential traits of a parser that abstracts from the fine detail and allows a uniform description and comparison of a variety of parsers, including Earley, Tomita, LR, Left-Corner, and Head-Corner parsers. The emphasis is on context-free phrase structure grammar and how these parsers can be extended to unification formalisms. The book combines mathematical rigor with high readability and is suitable as a graduate course text.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52407999201553,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52408000020753,"sku":"NLS9783642644511","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642644511.jpg?v=1758773739"},{"product_id":"grammatical-picture-generation-book-frank-drewes-9783642436628","title":"Grammatical Picture Generation","description":"This book introduces the reader to the notions, the techniques, and the theory of grammatical picture generation, a research field focusing on formal systems that describe sets of pictures by means of syntactic rules.    The book presents important types of picture generators, using a tree-based approach to stress their common algorithmic basis, the treatment influenced by the theory of computation, and the theory of formal languages in particular. It guides the reader through the basics of the tree-based approach on to dedicated chapters on line-drawing languages, collage grammars, iterated function systems, grid picture languages, languages of fractals, and languages of coloured collages, while presenting results about (un)decidable, NP-complete, or efficiently solvable problems, normal forms, hierarchies of language classes, and related phenomena.    In support, the book contains detailed exercises throughout. The book is of interest to researchers and graduate studentsin computer science and mathematics who are engaged with the theory and practice of picture-generating systems.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52430217838865,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52430218395921,"sku":"NLS9783642436628","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642436628.jpg?v=1759169107"},{"product_id":"abstract-computing-machines-book-werner-kluge-9783540211464","title":"Abstract Computing Machines","description":"The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. This book takes a lambda calculus approach to organizing computations. It sets out with a brief introduction to lambda calculus, describes a variant of the classical SECD-machine as a basic interpreter for the lambda calculus, and in the main part continues with fully normalizing abstract lambda calculus machines, of which some are interpreting and some execute compiled code.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52433155358993,"sku":"NLS9783540211464","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761599738129,"sku":"NIN9783540211464","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540211464.jpg?v=1759177083"},{"product_id":"complexity-theory-and-cryptology-book-jrg-rothe-9783540221470","title":"Complexity Theory and Cryptology","description":"Modern cryptology increasingly employs mathematically rigorous concepts and methods from complexity theory. Starting from scratch, it works its way to the frontiers of current research in these fields and provides a detailed overview of their history and their current research topics and challenges.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52433783816465,"sku":"NLS9783540221470","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761652134161,"sku":"NIN9783540221470","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783540221470.jpg?v=1759179019"},{"product_id":"formal-methods-for-software-engineering-book-markus-roggenbach-9783030387990","title":"Formal Methods for Software Engineering","description":"This is a graduate-level introduction to formal methods. The first part presents two formal languages: logic, in various forms, and Communicating Sequential Process (CSP) as a process algebra. The second part offers specification and testing methods for formal development of software. Building on the foundations from the first part, the reader is allowed to embrace methods for practical applications. The reader will find the examples cutting across chapters valuable for this purpose. The final section takes the reader further into application domains.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52452239868177,"sku":"NLS9783030387990","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783030387990.jpg?v=1759364088"},{"product_id":"dissemination-of-information-in-communication-networks-book-ralf-klasing-9783642056482","title":"Dissemination of Information in Communication Networks","description":"Preface Due to the development of hardware technologies (such as VLSI) in the early 1980s, the interest in parallel and distributive computing has been rapidly growingandinthelate1980sthestudyofparallelalgorithmsandarchitectures became one of the main topics in computer science. To bring the topic to educatorsandstudents, severalbooksonparallelcomputingwerewritten. The involvedtextbookIntroductiontoParallelAlgorithmsandArchitecturesby F. Thomson Leighton in 1992 was one of the milestones in the development of parallel architectures and parallel algorithms. But in the last decade or so the main interest in parallel and distributive computing moved from the design of parallel algorithms and expensive parallel computers to the new distributive reality - the world of interconnected computers that cooperate (often asynchronously) in order to solve di?erent tasks. Communication became one of the most frequently used terms of computer science because of the following reasons: (i) Considering the high performance of current computers, the communi- tion is often moretime consuming than the computing time of processors. As a result, the capacity of communication channels is the bottleneck in the execution of many distributive algorithms. (ii) Many tasks in the Internet are pure communication tasks. We do not want to compute anything, we only want to execute some information - change or to extract some information as soon as possible and as cheaply as possible. Also, we do not have a central database involving all basic knowledge. Instead, wehavea distributed memorywherethe basickno- edgeisdistributedamongthelocalmemoriesofalargenumberofdi?erent computers. The growing importance of solving pure communication tasks in the - terconnected world is the main motivation for writing this book.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52453614715153,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52453615304977,"sku":"NLS9783642056482","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642056482.jpg?v=1759368550"},{"product_id":"design-and-analysis-of-randomized-algorithms-book-j-hromkovic-9783642063008","title":"Design and Analysis of Randomized Algorithms","description":"Systematically teaches key paradigmic algorithm design methods      Provides a deep insight into randomization","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52453618909457,"sku":"NLS9783642063008","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642063008.jpg?v=1759368571"},{"product_id":"practical-theory-of-reactive-systems-book-r-kurki-suonio-9783642062377","title":"A Practical Theory of Reactive Systems","description":"A man may imagine he understands something, but still not understand anything in the way that he ought to. (Paul of Tarsus, 1 Corinthians 8:2) Calling this a 'practical theory' may require some explanation. Theory and practice are often thought of as two di'erent worlds, governed bydi'erentideals,principles, andlaws.DavidLorgeParnas, forinstance,who hascontributedmuchtoourtheoreticalunderstandingofsoftwareengineering and also to sound use of theory in the practice of it, likes to point out that 'theoretically' is synonymous to 'not really'. In applied mathematics the goal is to discover useful connections between these two worlds. My thesis is that in software engineering this two-world view is inadequate, and a more intimate interplay is required between theory and practice. That is, both theoretical and practical components should be integrated into a practical theory. It should beclearfrom theabovethattheintended readership of this book is not theoreticians. They would probably have di'culties in appreciating a book on theory where the presentation does not proceed in a logical sequence from basic de'nitions to theorems and mathematical proofs, followed by - plication examples. In fact, all this would not constitute what I understand by a practical theory in this context.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52453682675985,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52453683233041,"sku":"NLS9783642062377","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642062377.jpg?v=1759368786"},{"product_id":"abstract-computing-machines-book-werner-kluge-9783642059384","title":"Abstract Computing Machines","description":"The book addresses ways and means of organizing computations, highlighting the relationship between algorithms and the basic mechanisms and runtime structures necessary to execute them using machines. It completely abstracts from concrete programming languages and machine architectures, taking instead the lambda calculus as the basic programming and program execution model to design various abstract machines for its correct implementation. This book takes a lambda calculus approach to organizing computations. It sets out with a brief introduction to lambda calculus, describes a variant of the classical SECD-machine as a basic interpreter for the lambda calculus, and in the main part continues with fully normalizing abstract lambda calculus machines, of which some are interpreting and some execute compiled code.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52455497466129,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52455497892113,"sku":"NLS9783642059384","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642059384.jpg?v=1759374472"},{"product_id":"dna-computing-book-gheorghe-paun-9783642083884","title":"DNA Computing","description":"This is the first book on DNA computing, a molecular approach that may revolutionize computing-replacing silicon with carbon and microchips with DNA molecules. The book starts with an introduction to DNA computing, exploring the power of complementarity, the basics of biochemistry, and language and computation theory. It then brings the reader to the most advanced theories develop thus far in this emerging research area.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52473549390097,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52473551651089,"sku":"NLS9783642083884","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642083884.jpg?v=1759840163"},{"product_id":"introduction-to-process-algebra-book-wan-fokkink-9783642085840","title":"Introduction to Process Algebra","description":"Automated and semi-automated manipulation of so-called labelled transition systems has become an important means in discovering flaws in software and hardware systems. Process algebra has been developed to express such labelled transition systems algebraically, which enhances the ways of manipulation by means of equational logic and term rewriting. The theory of process algebra has developed rapidly over the last twenty years, and verification tools have been developed on the basis of process algebra, often in cooperation with techniques related to model checking. This textbook gives a thorough introduction into the basics of process algebra and its applications.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52475188150545,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52475189395729,"sku":"NLS9783642085840","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642085840.jpg?v=1759842209"},{"product_id":"complexity-theory-companion-book-lane-a-hemaspaandra-9783642086847","title":"The Complexity Theory Companion","description":"The Complexity Theory Companion is an accessible, algorithmically oriented, research-centered, up-to-date guide to some of the most interesting techniques of complexity theory.   The book's thesis is that simple algorithms are at the heart of complexity theory. From the tree-pruning and interval-pruning algorithms that shape the first chapter to the query simulation procedures that dominate the last chapter, the central proof methods of the book are algorithmic. And to more clearly highlight the role of algorithmic techniques in complexity theory, the book is - unlike other texts on complexity - organized by technique rather than by topic. Each chapter of this book focuses on one technique: what it is, and what results and applications it yields.    This textbook was developed at the University of Rochester in courses given to graduate students and advanced undergraduates. Researchers also will find this book a valuable source of reference due to the comprehensive bibliography of close to five hundred entries, the thirty-five page subject index, and the appendices giving overviews of complexity classes and reductions.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52475665056017,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52475666104593,"sku":"NLS9783642086847","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642086847.jpg?v=1759842884"},{"product_id":"parametric-lambda-calculus-book-simona-ronchi-della-rocca-9783642057465","title":"The Parametric Lambda Calculus","description":"The book contains a completely new presentation of classical results in the field of Lambda Calculus, together with new results. The text is unique in that it presents a new calculus (Parametric Lambda Calculus) which can be instantiated to obtain already known lambda-calculi. Some properties, which in the literature have been proved separately for different calculi, can be proved once for the Parametric one. The lambda calculi are presented from a Computer Science point of view, with a particular emphasis on their semantics, both operational and denotational.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52475965702417,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52475966750993,"sku":"NLS9783642057465","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642057465.jpg?v=1759843331"},{"product_id":"interactive-theorem-proving-and-program-development-book-yves-bertot-9783642058806","title":"Interactive Theorem Proving and Program Development","description":"Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. It is based on a theory called the calculus of inductive constructions, a variant of type theory.   This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. With its large collection of examples and exercises it is an invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52476232630545,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52476233908497,"sku":"NLS9783642058806","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642058806.jpg?v=1759843734"},{"product_id":"elements-of-finite-model-theory-book-leonid-libkin-9783642059483","title":"Elements of Finite Model Theory","description":"Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other areas, such as formal methods and verification, and artificial intelligence, have been discovered. The birth of finite model theory is often identified with Trakhtenbrot's result from 1950 stating that validity over finite models is not recursively enumerable; in other words, completeness fails over finite models. The tech- nique of the proof, based on encoding Turing machine computations as finite structures, was reused by Fagin almost a quarter century later to prove his cel- ebrated result that put the equality sign between the class NP and existential second-order logic, thereby providing a machine-independent characterization of an important complexity class. In 1982, Immerman and Vardi showed that over ordered structures, a fixed point extension of first-order logic captures the complexity class PTIME of polynomial time computable propertiE s. Shortly thereafter, logical characterizations of other important complexity classes were obtained. This line of work is often referred to as descriptive complexity. A different line of finite model theory research is associated with the de- velopment of relational databases. By the late 1970s, the relational database model had replaced others, and all the basic query languages for it were es- sentially first-order predicate calculus or its minor extensions.","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52477964255505,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52477965664529,"sku":"NLS9783642059483","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642059483.jpg?v=1759846438"},{"product_id":"introduction-to-circuit-complexity-book-heribert-vollmer-9783642083983","title":"Introduction to Circuit Complexity","description":"An advanced textbook giving a broad, modern view of the computational complexity theory of boolean circuits, with extensive references, for theoretical computer scientists and mathematicians.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52478425137425,"sku":"NLS9783642083983","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642083983.jpg?v=1759847160"},{"product_id":"theoretical-computer-science-book-juraj-hromkovi-9783642057298","title":"Theoretical Computer Science","description":"The aim of this textbook is not only to provide an elegant route through the theoretical fundamentals of computer science, but also to show that theoretical computer science is a fascinating discipline, full of spectacular contributions and miracles, and depth in research, and yet directly applicable. Thus, we aim to excite people about its study. To achieve these goals we do not hesitate to take a lot of space to present motivations, and especially to give the informal development of crucial ideas and concepts and their transparent, but rigorous presentation.   An additional aim is to present the development of the computer scientist's way of thinking, so we do not restrict this book to the classic areas like computability and automata theory but we also present fundamental concepts such as approximation and randomization in algorithmics and we explain the basic ideas of cryptography and interconnection network design.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52479019188497,"sku":"NLS9783642057298","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761785663761,"sku":"NIN9783642057298","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642057298.jpg?v=1759848047"},{"product_id":"information-and-randomness-book-cristian-s-calude-9783642077937","title":"Information and Randomness","description":"The first edition of the monograph Information and Randomness: An Algorithmic Perspective by Crist ian Calude was published in 1994. In my Foreword I said: The research in algorithmic information theory is already some 30 years old. However, only the recent years have witnessed a really vigorous growth in this area. . . . The present book by Calude fits very well in our series. Much original research is presented. . . making the approach richer in consequences than the classical one. Remarkably, however, the text is so self-contained and coherent that the book may also serve as a textbook. All proofs are given in the book and, thus, it is not necessary to consult other sources for classroom instruction.  The vigorous growth in the study of algorithmic information theory has continued during the past few years, which is clearly visible in the present second edition. Many new results, examples, exercises and open prob- lems have been added. The additions include two entirely new chapters: Computably Enumerable Random Reals and Randomness and Incom- pleteness. The really comprehensive new bibliography makes the book very valuable for a researcher. The new results about the characterization of computably enumerable random reals, as well as the fascinating Omega Numbers, should contribute much to the value of the book as a textbook. The author has been directly involved in these results that have appeared in the prestigious journals Nature, New Scientist and Pour la Science.","brand":"WoB","offers":[{"title":"GB \/ NEW \/ INGRAM","offer_id":52480229474577,"sku":"NLS9783642077937","price":0.0,"currency_code":"GBP","in_stock":true},{"title":"US \/ NEW \/ INGRAM","offer_id":52761794281745,"sku":"NIN9783642077937","price":0.0,"currency_code":"GBP","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642077937.jpg?v=1759849907"},{"product_id":"public-key-cryptography-book-arto-salomaa-9783642082542","title":"Public-Key Cryptography","description":"Cryptography, secret writing, is enjoying a scientific renaissance following the seminal discovery in 1977 of public-key cryptography and applications in computers and communications. This book gives a broad overview of public-key cryptography - its essence and advantages, various public-key cryptosystems, and protocols - as well as a comprehensive introduction to classical cryptography and cryptoanalysis. The second edition has been revised and enlarged especially in its treatment of cryptographic protocols. From a review of the first edition: \"This is a comprehensive review ... there can be no doubt that this will be accepted as a standard text. At the same time, it is clearly and entertainingly written ... and can certainly stand alone.\" Alex M. Andrew, Kybernetes, March 1992","brand":"WoB","offers":[{"title":"- \/ - \/ INTERNAL","offer_id":52480664043793,"sku":null,"price":0.0,"currency_code":"GBP","in_stock":true},{"title":"GB \/ NEW \/ INGRAM","offer_id":52480665354513,"sku":"NLS9783642082542","price":0.0,"currency_code":"GBP","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0784\/4072\/6801\/files\/9783642082542.jpg?v=1759850566"}],"url":"https:\/\/www.worldofbooks.com\/en-gb\/collections\/texts-in-theoretical-computer-science-an-eatcs-series-book-series.oembed?page=2","provider":"World of Books ","version":"1.0","type":"link"}