Modern Computer Arithmetic
by Richard P. Brent, Paul Zimmermann
Publisher: LORIA 2009
Number of pages: 239
This book collects in the same document all state-of-the-art algorithms in multiple precision arithmetic (integers, integers modulo n, floating-point numbers). The book will be useful for graduate students in computer science and mathematics, researchers in discrete mathematics, computer algebra, number theory, cryptography, and developers of multiple-precision libraries.
Home page url
Download or read it online for free here:
by Nashat Mansour - InTech
This book demonstrates the applicability of search algorithms for the purpose of developing solutions to problems that arise in a variety of domains. It is targeted to a wide group of readers: researchers, graduate students, and practitioners.
by K. Raghava Rao - Smashwords
This book provides a complete information to the modern study of computer algorithms. It presents many concepts in a considerable depth, so that it can be understand by all levels of readers. Each and every concept is explained by suitable examples.
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 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.