by Marko Petkovsek, Herbert S. Wilf, Doron Zeilberger
Publisher: AK Peters, Ltd. 1996
Number of pages: 217
This book introduces the idea of hypergeometric function, the Swiss army knife of combinatorial mathematics, and proceeds to develop algorithms for their computation as well as numerous applications. The authors also reveal what, exactly, computers can help us to decide, what is a "closed form" solution, what are "canonical" and "normal" forms, and inject relevant philosophical digressions that keep the discussions lively and entertaining. The authors also present snippets of "Mathematica" code so that you can try out many of the basic operations yourself.
Home page url
Download or read it online for free here:
by Ian Craw, John Pulham - University of Aberdeen
This course studies computer algorithms, their construction, validation and effectiveness. A number of topics will be covered: a general introduction to the subject, the problem of sorting data sets into order, the theory of formal grammars, etc.
by Allen B. Downey - Green Tea Press
This book is intended for college students in computer science and related fields. The book also presents basic aspects of software engineering practice, including version control and unit testing. Each chapter ends with an exercises.
by Jeffrey Scott Vitter - Now Publishers
The book describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, etc.
by Macneil Shonle, Matthew Wilson, Martin Krischik - Wikibooks
An accessible introduction into the design and analysis of efficient algorithms. It explains only the most basic techniques, and gives intuition for and an introduction to the rigorous mathematical methods needed to describe and analyze them.