LEDA: A Platform for Combinatorial and Geometric Computing
by K. Mehlhorn, St. Näher
Publisher: Cambridge University Press 1999
ISBN/ASIN: 0521563291
ISBN-13: 9780521563291
Number of pages: 1034
Description:
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.
Download or read it online for free here:
Download link
(multiple PS files)
Similar books
Algorithms and Complexityby Herbert S. Wilf - AK Peters, Ltd.
An introductory textbook on the design and analysis of algorithms. Recursive algorithms are illustrated by Quicksort, FFT, and fast matrix multiplications. Algorithms in number theory are discussed with some applications to public key encryption.
(23682 views)
Introduction to Design Analysis of Algorithmsby 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.
(14717 views)
Algorithmsby Robert Sedgewick, Kevin Wayne - Addison-Wesley Professional
This textbook surveys the most important algorithms and data structures in use today. Applications to science, engineering, and industry are a key feature of the text. We motivate each algorithm by examining its impact on specific applications.
(15236 views)
Modern Computer Arithmeticby Richard P. Brent, Paul Zimmermann - LORIA
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.
(17472 views)