Feynman Lectures On Computation

Feynman Lectures On ComputationWhen, in 198486, Richard P Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at

Introduction to Automata Theory, Languages, and Computation

Introduction to Automata Theory, Languages, and ComputationIt has been than 20 years since this classic book on formal languages, automata theory, and computational complexity was first published With this long awaited revision, the authors continue to present the theory in a concise and straightforward manner, now with an eye out for the practical

Introduction to Algorithms

Introduction to AlgorithmsThis title covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers Each chapter is relatively self contained and can be used as a unit of study The algorithms are described in English and in a pseudocode designed to be readable by anyone

The Algorithm Design Manual

The Algorithm Design ManualThis volume helps take some of the mystery out of identifying and dealing with key algorithms Drawing heavily on the author s own real world experiences, the book stresses design and analysis Coverage is divided into two parts, the first being a general guide to techniques for the design and

The Mathematical Theory of Communication

The Mathematical Theory of CommunicationScientific knowledge grows at a phenomenal pace but few books have had as lasting an impact or played as important a role in our modern world as The Mathematical Theory of Communication, published originally as a paper on communication theory in the Bell System Technical Journal than fifty

The Nature of Computation

The Nature of ComputationComputational complexity is one of the most beautiful fields of modern mathematics, and it is increasingly relevant to other sciences ranging from physics to biology But this beauty is often buried underneath layers of unnecessary formalism, and exciting recent results like interactive proofs,

Information Theory, Inference and Learning Algorithms

Information Theory, Inference and Learning AlgorithmsInformation theory and inference, often taught separately, are here united in one entertaining textbook These topics lie at the heart of many exciting areas of contemporary science and engineering communication, signal processing, data mining, machine learning, pattern recognition, computational

Compilers: Principles, Techniques, and Tools

Compilers: Principles, Techniques, and ToolsThis introduction to compilers is the direct descendant of the well known book by Aho and Ullman, Principles of Compiler Design The authors present updated coverage of compilers based on research and techniques that have been developed in the field over the past few years The book provides a

Purely Functional Data Structures

Purely Functional Data StructuresMost books on data structures assume an imperative language such as C or C However, data structures for these languages do not always translate well to functional languages such as Standard ML, Haskell, or Scheme This book describes data structures from the point of view of functional languages,