Algorithm Design and Software Libraries: Recent Developments in the LEDA Project (1992)
by
Kurt Mehlhorn
,
Stefan Näher
| Venue: | IN PROC. IFIP 12TH WORLD COMPUTER CONGRESS |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Mehlhorn92algorithmdesign,
author = {Kurt Mehlhorn and Stefan Näher},
title = {Algorithm Design and Software Libraries: Recent Developments in the LEDA Project},
booktitle = {IN PROC. IFIP 12TH WORLD COMPUTER CONGRESS},
year = {1992},
pages = {493--505},
publisher = {Elsevier}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
LEDA (Library of Efficient Data Types and Algorithms) is an ongoing project which aims to build a library of the efficient data structures and algorithms used in combinatorial computing [12]. We discuss three recent aspects of the project: The cost of flexibility, implementation parameters, and augmented trees.
