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 met...Lasīt vairāk
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 met...Lasīt vairāk
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 advan...Lasīt vairāk
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. Each model is accompanied by relevant formal techniques for reasoning...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 22-Nov-2016, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662504970)
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 conce...Lasīt vairāk
This textbook explains online computation in different settings, with particular emphasis on randomization and advice complexity. These settings are analyzed for various online problems such as the paging problem, the k-server problem, job shop sched...Lasīt vairāk
Eric Badouel, Luca Bernardinello, Philippe Darondeau
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 02-Nov-2015, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662479674)
This book is a comprehensive, systematic survey of the synthesis problem, and of region theory which underlies its solution, covering the related theory, algorithms, and applications. The authors focus on safe Petri nets and place/transition nets (P/...Lasīt vairāk
This book presents the fundamentals of concurrency theory with clarity and rigor. The authors start with the semantic structure, namely labelled transition systems, which provides us with the means and the tools to express processes, to compose them,...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 17-Apr-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662032695)
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...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 14-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662052693)
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer tech- nologies. Because of this, the design of algorithms for solving hard problems is the core of curre...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 14-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662048801)
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 books thesis is that simple algorithms are at the heart of complexity...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 14-Mar-2013, PDF+DRM, Izdevniecība: Springer Berlin Heidelberg, ISBN-13: 9783662046166)
Algorithmic design, especially for hard problems, is more essential for success in solving them than any standard improvement of current computer technologies. Because of this, the design of algorithms for solving hard problems is the core of current...Lasīt vairāk
Yves Bertot, G. Huet, Pierre Castéran, C. Paulin-Mohring
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 14-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662079645)
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 introd...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662034422)
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 the...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662103944)
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 al...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662042939)
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 alg...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662049785)
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: "e;The research in algorithmic information theory is already some 30 years old. However, o...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662070031)
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, altho...Lasīt vairāk
Sērija : Texts in Theoretical Computer Science. An EATCS Series
(Izdošanas datums: 09-Mar-2013, PDF+DRM, Izdevniecība: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG, ISBN-13: 9783662107782)
Reactive systems are becoming more and more important for essentially all areas of technical and professional activities as well as for many areas of everyday life. The design of these systems is a great challenge and requires sound compromises betwe...Lasīt vairāk
