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 Solomon I. Khmelnik - MiC
This book describes various processors, designed for affine transformations of many-dimensional figures -- planar and spatial. Designed for students, engineers and developers, who intend to use the computer arithmetic of geometrical figures.
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.
A data structure is a particular way of storing and organizing data in a computer so that it can be used efficiently. Contents of the book: Sequences; Dictionaries; Sets; Priority queues; Successors and neighbors; Integer and string searching.
by K. Mehlhorn, St. Näher - Cambridge University Press
The book treats the architecture, the implementation, and the use of the LEDA system. LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing, written in C++ and freely available worldwide.