- Hardcover: 1034 pages
- Publisher: Cambridge University Press (November 28, 1999)
- Language: English
- ISBN-10: 0521563291
- ISBN-13: 978-0521563291
- Product Dimensions: 6.8 x 2.2 x 9.7 inches
- Shipping Weight: 4.3 pounds
- Average Customer Review: 3 customer reviews
- Amazon Best Sellers Rank: #2,432,274 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
LEDA: A Platform for Combinatorial and Geometric Computing
Use the Amazon App to scan ISBNs and compare prices.
Customers who viewed this item also viewed
"LEDA presents a different sort of library, namely, one that supports the type of programming that is the basis of our standard algorithm and data structures courses... LEDA, the book, complements LEDA, the library... I find it both highly commendable and also somewhat mind-boggling that well-known researchers will take time to contribute in substantialways to the practice: commendable, because such work contributes to the vitality and progress of the practical side of our discipline, while simultaneously validating the need for fundamental research; and mind-boggling because I can only imagine the investment of time such a project requires. A measure of LEDA'S success can ben found in its use. At the time the book was written over 1500 institutions had intalled LEDA on local systems... And so, my hat is off to Kurt Mehlhorn and Stefan Naher for their fine contribution to our discipline." SIGACT News
"...a comprehensive treatment of the system and its use." Mathematical Reviews
LEDA is a library of efficient data types and algorithms and a platform for combinatorial and geometric computing. In each of the core areas of data structures, graph and network algorithms, and computational geometry, LEDA covers all (and more) that is found in the standard textbooks. LEDA is the first such library and this is the first book devoted to it. Written by the main authors of LEDA it is the definitive account, making the book essential for all workers in algorithms, data structures and computational geometry.
Top customer reviews
algorithms *and* how to prove their correctness *and* their concrete
implementation in C++ *and* how to prove the correctness of the given
implementation *and* how to speed up the implementation *and* the
proper use of the fantastic LEDA-library *and* the underlying object
oriented design *and* how to do fine software engineering.
I've really read every single line of this book, even every single
line of code and I'm filled with enthusiasm. It is definitely a
must-read for every scientific programmer who wishes to improve his
style of programming, the correctness and speed of his code, his time
spent for coding, or who just wants to learn about the most important data
structures and their implementation and how to borrow them from the
award winning LEDA library instead of inventing the wheel twice.
This book finishes the time of boring pseudocode lyricists who teach
you how and why an algorithm and his data structures work, but not how
you can *get* them to work.