Algorithms and Complexity
by Herbert S. Wilf
Publisher: AK Peters, Ltd. 1994
Number of pages: 139
This is an introductory textbook, suitable for classroom use, on the design and analysis of algorithms, complexity, methods for solving problems on computers and the costs (usually in running time) of using those methods.
Home page url
Download or read it online for free here:
by David M. Mount - University of Maryland
The focus is on how to design good algorithms, and how to analyze their efficiency. The text covers some preliminary material, optimization algorithms, graph algorithms, minimum spanning trees, shortest paths, network flows and computational geometry.
by Anil K. Jain, Richard C. Dubes - Prentice Hall
The book is useful for scientists who gather data and seek tools for analyzing and interpreting data. It will be a reference for scientists in a variety of disciplines and can serve as a textbook for a graduate course in exploratory data analysis.
by John Morris
The text focuses on data structures and algorithms for manipulating them. Data structures for storing information in tables, lists, trees, queues and stacks are covered. Some basic graph and discrete transform algorithms are also discussed.
by Jeff Erickson - University of Illinois at Urbana-Champaign
These are lecture notes, homework questions, and exam questions from algorithms courses the author taught at the University of Illinois. It is assumed that the reader has mastered the material covered in the first 2 years of a typical CS curriculum.