Processing ......
FreeComputerBooks.com
Links to Free Computer, Mathematics, Technical Books all over the World
 
Algorithms
网址居 (LinkBasket) - 海外中英文新闻网站导航!.
  • Title: Algorithms
  • Author(s) Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
  • Publisher: McGraw-Hill Science/Engineering/Math; 1 edition (September 13, 2006)
  • Paperback: 336 pages
  • eBook: PDF Files
  • Language: English
  • ISBN-10: 0073523402
  • ISBN-13: 978-0073523408
  • Share This:  

Book Description

This text, extensively class-tested over a decade at UC Berkeley and UC San Diego, explains the fundamentals of algorithms in a story line that makes the material enjoyable and easy to digest. Emphasis is placed on understanding the crisp mathematical idea behind each algorithm, in a manner that is intuitive and rigorous without being unduly formal.

Features include: The use of boxes to strengthen the narrative: pieces that provide historical context, descriptions of how the algorithms are used in practice, and excursions for the mathematically sophisticated.

Carefully chosen advanced topics that can be skipped in a standard one-semester course, but can be covered in an advanced algorithms course or in a more leisurely two-semester sequence.

An accessible treatment of linear programming introduces students to one of the greatest achievements in algorithms. An optional chapter on the quantum algorithm for factoring provides a unique peephole into this exciting topic. In addition to the text, DasGupta also offers a Solutions Manual, which is available on the Online Learning Center.

About the Authors
  • N/A
Reviews, Rating, and Recommendation: Related Book Categories: Read and Download Links: Similar Books:
  • Algorithm Design (Jon Kleinberg, et al)

    This book introduces algorithms by looking at the real-world problems that motivate them. The book teaches a range of design and analysis techniques for problems that arise in computing applications.

  • Lecture Notes for the Algorithms (Jeff Erickson)

    This lecture notes uniquely combines rigor and comprehensiveness. It 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.

  • Algorithms: Fundamental Techniques (Macneil Shonle, et al)

    The goal of the book is to show you how you can methodically apply different techniques to your own algorithms to make them more efficient. While this book mostly highlights general techniques, some well-known algorithms are also looked at in depth.

  • Elementary Algorithms (Xinyu Liu)

    This book doesn't only focus on an imperative (or procedural) approach, but also includes purely functional algorithms and data structures. It teaches you how to think like a programmer - find the practical efficiency algorithms to solve your problems.

  • Algorithms and Data Structures (Niklaus Wirth)

    From the inventor of Pascal and Modula-2 comes a new version of Niklaus Wirth's classic work, Algorithms + Data Structure = Programs (PH, l975). It includes new material on sequential structure, searching and priority search trees.

  • The Algorithm Design Manual (Steven S. Skiena)

    This book serves as the primary textbook for any algorithm design course while maintaining its status as the premier practical reference guide to algorithms, intended as a manual on algorithm design for both students and computer professionals.

  • Introduction to Design Analysis of Algorithms (K. Raghava Rao)

    This book was very useful to easily understand the algorithms. This book is having enough examples on every algorithm. It has written for the sake of students to provide complete knowledge on Algorithms.

Book Categories
:
Other Categories
Resources and Links