**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 for Clustering Data**

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.

(

**13631**views)

**Data Structures and Algorithms**

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.

(

**9618**views)

**Algorithms and Complexity**

by

**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.

(

**13341**views)

**Randomized Algorithms**

by

**Wolfgang Merkle**-

**ESSLLI**

The first part of the course gives an introduction to randomized algorithms and to standard techniques for their derandomization. The second part presents applications of the probabilistic method to the construction of logical models.

(

**6265**views)