by Jeff Erickson
Publisher: University of Illinois at Urbana-Champaign 2009
Number of pages: 765
This course packet includes lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois at Urbana-Champaign. For the most part, these notes assume that the reader has mastered the material covered in the first two years of a typical undergraduate computer science curriculum.
Home page url
Download or read it online for free here:
by Wojciech Szpankowski - Wiley-Interscience
A book on a topic that has witnessed a surge of interest over the last decade, owing in part to several novel applications in data compression and computational molecular biology. It describes methods employed in average case analysis of algorithms.
by Granville Barnett, Luca Del Tongo - DotNetSlackers
The book provides implementations of common and uncommon algorithms in pseudocode which is language independent and provides for easy porting to most programming languages. We assume that the reader is familiar with the object oriented concepts.
by Steven M. LaValle - Cambridge University Press
Written for computer scientists and engineers with interests in artificial intelligence, robotics, or control theory, this book tightly integrates a vast body of literature from several fields into a coherent source for reference in applications.
by Chris Okasaki - Carnegie Mellon University
This book describes data structures from the point of view of functional languages. The author includes both classical data structures, such as red-black trees, and a host of new data structures developed exclusively for functional languages.