It looks like you're using Internet Explorer 11 or older. This website works best with modern browsers such as the latest versions of Chrome, Firefox, Safari, and Edge. If you continue with this browser, you may see unexpected results.

- Introduction to the Theory of Computation byCall Number: ONLINE and 252 Si66 2012ISBN: 9781133187813Publication Date: 2013Gain a clear understanding of even the most complex, highly theoretical computational theory topics in the approachable presentation found only in the market-leading INTRODUCTION TO THE THEORY OF COMPUTATION, 3E. The number one choice for today's computational theory course, this revision continues the book's well-know, approachable style with timely revisions, additional practice, and more memorable examples in key areas.
- Model Checking, Second Edition byCall Number: 252 CL37 2018ISBN: 9780262038836Publication Date: 2018An expanded and updated edition of a comprehensive presentation of the theory and practice of model checking, a technology that automates the analysis of complex systems. Model checking is a verification technology that provides an algorithmic means of determining whether an abstract model--representing, for example, a hardware or software design--satisfies a formal specification expressed as a temporal logic formula. If the specification is not satisfied, the method identifies a counterexample execution that shows the source of the problem. Today, many major hardware and software companies use model checking in practice, for verification of VLSI circuits, communication protocols, software device drivers, real-time embedded systems, and security algorithms.
- Introduction to Algorithms byCall Number: ONLINE and 252.5 Co55 2009ISBN: 9780262033848Publication Date: 2009
**הספר בעברית: מבוא לאלגוריתמים**

A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow. - Computational complexity : a modern approach byCall Number: 252.5 Ar57ISBN: 9780521424264Publication Date: 2009This beginning graduate textbook describes both recent achievements and classical results of computational complexity theory. [...] The book starts with a broad introduction to the field and progresses to advanced results.
- Algorithm Design byCall Number: ONLINE and 252.5 Kl45ISBN: 9780321372918Publication Date: 2006
**הספר בעברית: פיתוח אלגוריתמים**

Algorithm Design introduces algorithms by looking at the real-world problems that motivate them. [...] The text encourages an understanding of the algorithm design process and an appreciation of the role of algorithms in the broader field of computer science. - Networks, Crowds, and Markets byCall Number: 252.6 Ea73ISBN: 9780521195331Publication Date: 2010www.cs.cornell.edu/home/kleinber/networks-book

There is a growing awareness of the complex networks that pervade modern society. We see them in the rapid growth of the internet, the ease of global communication, the swift spread of news and information, and in the way epidemics and financial crises develop with startling speed and intensity. This introductory book on the new science of networks takes an interdisciplinary approach, using economics, sociology, computing, information science and applied mathematics to address fundamental questions about the links that connect us, and the ways that our decisions can have consequences for others. - Twenty Lectures on Algorithmic Game Theory byCall Number: ONLINEISBN: 1316782093Publication Date: 2016This book grew out of the author's Stanford University course on algorithmic game theory, and aims to give students and other newcomers a quick and accessible introduction to many of the most important concepts in the field. The book also includes case studies on online advertising, wireless spectrum auctions, kidney exchange, and network management.

**252** Theory of computation. Metatheory. Category

**252.1** Logic, Formal systems

**252.11** Boolean algebras

**252.12** Theorem proving. Constraint satisfaction systems

**252.13** Dynamic logic. Temporal logic

**252.14** Petri Nets

**252.2** Automata theory

**252.21** Finite state automata

**252.22** Cellular automata

**252.23** Stochastic automata

**252.24** Sequential machines

**252.25** Tree Automata

**252.3** Formal languages

**252.4** Programs schemata. Semantics. Correctness. Program specifications (see also 241.8)

**252.5** Computational complexity. Efficiency of algorithms. Algorithmic randomness

**252.6** Algorithmic game theory. Algorithmic mechanism design. Algorithmic social choice. Electronic commerce

**252.7** Computability. Unsolvability. Recursive functions

**252.8** Rewriting systems. Graph reductions