Logo

LEDA: A Platform for Combinatorial and Geometric Computing

Large book cover: LEDA: A Platform for Combinatorial and Geometric Computing

LEDA: A Platform for Combinatorial and Geometric Computing
by

Publisher: Cambridge University Press
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.

Home page url

Download or read it online for free here:
Download link
(multiple PS files)

Similar books

Book cover: Data Structures and AlgorithmsData Structures and Algorithms
by
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.
(10317 views)
Book cover: The Art of Computer Programming, Volume 4The Art of Computer Programming, Volume 4
by - Addison-Wesley Professional
This work on the analysis of algorithms has long been recognized as the definitive description of classical computer science, arguably the most influential work ever written on computer programming. Volume 4 covers Combinatorial Algorithms.
(17277 views)
Book cover: Algorithms for Modular Elliptic CurvesAlgorithms for Modular Elliptic Curves
by - Cambridge University Press
The author describes the construction of modular elliptic curves giving an algorithm for their computation. Then algorithms for the arithmetic of elliptic curves are presented. Finally, the results of the implementations of the algorithms are given.
(11804 views)
Book cover: Algorithms and Data Structures: The Basic ToolboxAlgorithms and Data Structures: The Basic Toolbox
by - Springer
This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, etc.
(8386 views)