|
Algorithmic Problem Solving
| 2006 | An introduction to algorithms using an example-driven approach |
|
Algorithms and Complexity
| 1994 | This book is about algorithms and complexity, and so it is about methods for solving problems on computers and the costs (usually the running time) of using those methods. |
|
Approximation Algorithms
| 1997 | This book deals with designing polynomial time approximation algorithms for NP-hard optimization problems. |
|
Complexity Theory
| 1999 | Notes for an introductory graduate course on complexity theory. |
|
Computation Complexity
| 1994 | This book focuses on the need to be able to measure the complexity of a problem, algorithm or structure, and to obtain bounds and quantitive relations for complexity. |
|
Data Structures and Algorithms with Object-Oriented Design Patterns in C#
| 2001 | This book presents the various data structures and algorithms as complete C# program fragments. |
|
Data Structures and Algorithms with Object-Oriented Design Patterns in C++
| 1999 | This book presents the various data structures and algorithms as complete C++ program fragments. |
|
Data Structures and Algorithms with Object-Oriented Design Patterns in Java
| 1999 | This book presents the various data structures and algorithms as complete Java program fragments. |
|
Foundations of Computer Science
| 2000 | Lecture notes for the Foundations of Computer Science course at the Computer Laboratory, University of Cambridge. |
|
Introduction to Complexity Theory
| 2001 | A course aimed at exposing the students to the basic results and research directions of Complexity Theory. |
|
Numerical Recipes in C
| 1992 | This book aims to teach the reader methods of numerical computing that are practical, efficient, and elegant. The authors presume that the reader has particular tasks that he needs to accomplish, and they aim to educate the reader how to proceed. |
|
Problems on Algorithms
| 2002 | A collection of problems on the design, analysis, and verification of algorithms for use by practicing programmers who wish to hone and expand their skills. |
