 |
| Design and Analysis of Computer Algorithms |
| Programming is a very complex task, and there are a number of aspects of programming that make it so complex. The first is that most programming projects are very large, requiring the coordinated efforts of many people. (This is the topic a course li...more » |
|
 |
| |
|
|
| Design and Analysis of Algorithms: Course Notes |
| The notes will cover many different topics. Readers will start out by studying various combinatorial algorithms together with techniques for analyzing their performance. Readers will also study linear programming and understand the role that it plays...more » |
|
|
| |
|
|
|
|
| |
|
|
|
|
| |
|
|
|
|
| |
|
|
|
|
| |
|
|
| Combinatorial Algorithms |
| These lecture notes is about algorithms, especially combinatorial algorithms. Put in its basic form, an algorithm is a set of simple, unambiguous, step-by-step instructions for accomplishing a specific task. Note that the word 'computer' doesn't appe...more » |
|
|
| |
|
|
| Average Case Analysis of Algorithms on Sequences |
| This is a book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications, most notably in data compression and computational molecular biology. It describes methods employed in average case an...more » |
|
|
| |
|
|
| Art of Programming Contest |
| The book covers several important topics related to the development of programming skills such as, fundamental concepts of contest, game plan for a contest, essential data structures for contest, input/output techniques, brute force method, mathemati...more » |
|
|
| |
|
|
| Art Gallery Theorems and Algorithms |
| This book is a research monograph on a topic that falls under both combinatorial geometry, a branch of mathematics, and computational geometry, a branch of computer science. The research described is recent: the earliest dates from the mid 1970s, and...more » |
|
|
| |
|
|
| Algorithms in the Real World: Lecture Notes |
| The notes contained in this document are based on what was covered in the lectures and are not meant to be complete, and although the scribe takers corrected many of the mistakes in the lectures, many others got through. Unfortunately the notes conta...more » |
|
|
| |
|
|
| Algorithms for Programmers |
| This draft is first created to accompany the already established collection of FXT libraries by the same author, on the fast transforms and low level algorithms. So far there has been 23 chapters of selected algorithms, each contains the necessary th...more » |
|
|
| |
|
|
| Algorithms |
| This book evolved over the past ten years from a set of lecture notes developed by the authors while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego....more » |
|
|
| |
|
|
| Algorithmic Problem Solving |
| In historical terms, the digital computer is very, very new. The science of computing is yet newer. Compared to its older sister - mathematics - which is thousands of years old, it is hardly in the embryonic stage of development. Yet, computing scien...more » |
|
|
| |
|
|
|
