Algorithms (English, Paperback, Dasgupta Sanjoy)

Algorithms is a textbook designed primarily for undergraduate students. Presented in a reader-friendly format, this book takes a look at the subject of algorithms.

Summary Of The Book

Algorithms comprehensively covers the fundamentals of the subject of algorithms. It explains the mathematical logic behind every algorithm presented.

The book is divided into four parts. The first part focuses on the Divide-And-Conquer algorithms for integer multiplication, RSA cryptosystem, fast Fourier transform, as well as sorting and median finding. The next part takes a very traditional approach and is self contained. It explains graphs and data structures, and can even be taught before the first part. The first half of Algorithms has been designed to concentrate on special types of problems.

The third part deals with general techniques and principles like Linear Programming and Dynamic Programming. The last part teaches students to deal with complex problems, such as heuristics and NP-completeness.

There is also an optional chapter based on Quantum Algorithm, which is a very advanced topic. Some other chapters from the book are Decompositions of graphs, Greedy algorithms, and Coping with NP-completeness. The historical roots of the subject, the use of algorithms in the real world, and excursions for the mathematically sophisticated are also included.

The authors of Algorithms have written this text in an intuitive manner. They have made this subject easy for students to understand. This book was published for undergraduate students and is backed by a decade of research conducted at UC Berkeley and UC San Diego. The basic topics can be covered in one semester, whereas the advanced sections will take a second term. A solutions manual has also been provided. It can be accessed from the Online Learning Center.

About The Authors

Christos Harilaos Papadimitriou is an author and professor. Papadimitriou has written Computational Complexity, Elements Of The Theory Of Computation, Combinatorial Optimization: Algorithms And Complexity, and The Theory Of Database Concurrency Control. He has also published a novel called Turing. He graduated with a BS in Electronics Engineering from Athens Polytechnic in the year 1972. Papadimitriou went on to complete his MS and PhD from Princeton. He is currently a professor in the Computer Science Department of the University of California, Berkeley.

Umesh Vazirani completed his PhD in the year 1986 from the University of California, Berkeley. He is now a Roger A. Strauch Professor of Electrical Engineering and Computer Science at the same university. The author won the Fulkerson award in 2012. Vazirani is also the director of the Quantum Computation Centre.

Sanjoy Dasgupta is an author and researcher. Dasgupta is on the editorial boards of numerous journals. He did his BA in Computer Science from Harvard, followed by a PhD from the University of California, Berkeley. Dasgupta joined AT&T Labs-Research as a senior member of the technical staff. He is currently working in UCSD Jacobs School, where he develops algorithms.