FAQ

Library of Efficient Data types and Algorithms

The Library of Efficient Data types and Algorithms (LEDA) is a proprietarily-licensed software library providing C++ implementations of a broad… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1992-2014
051019922014

Related topics

Related topics

10 relations
Algorithm engineeringBentley–Ottmann algorithmC++CGAL
(More)

Related mentions per year

Related mentions per year

1936-2018
19401960198020002020
Library of Efficient Data types and Algorithms
Library
C++
Graph theory
Computational geometry
Algorithm engineering

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2007
2007
Fine-Grained Software Metrics in Practice
Modularity is one of the key features of the Object- Oriented (00) paradigm. Low coupling and high cohesion help to achieve good… (More)
  • figure 1
  • table 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
2006
2006
Shape Analysis of Sets
Shape Analysis is concerned with determining shape invariants , i.e. structural properties of the heap, for programs that… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2004
2004
Estimating the domain of attraction for uncertain polynomial systems
Estimating the Domain of Attraction (DA) of equilibrium points is a problem of fundamental importance in systems engineering… (More)
  • figure 1
  • figure 2
Is this relevant?
2003
2003
An efficient graph algorithm for dominance constraints
Dominance constraints are logical descriptions of trees that are widely used in computational linguistics. Their general… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.2
  • figure 3.4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Recovering Documentation-to-Source-Code Traceability Links using Latent Semantic Indexing
An information retrieval technique, latent semantic indexing, is used to automatically identify traceability links from system… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
1999
1999
Vega|A user-centered approach to the distributed visualization of geometric algorithms
We present a new approach to the distributed vi-sualization of geometric algorithms that emphasizes the position of the end user… (More)
  • figure 2
  • figure 8
  • figure 10
Is this relevant?
Highly Cited
1999
Highly Cited
1999
Specification and Refinement of Dynamic Software Architectures
Software Architecture deals with the description, analysis and reuse of the structure of software systems. Several notations and… (More)
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1998
1998
Functionality versus Practicality: Employing Existing Tools for Recovering Structural Design Patterns
The object-oriented design community has recently begun to collect so-called software design patterns : descriptions of proven… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1996
Highly Cited
1996
Design Recovery by Automated Search for Structural Design Patterns in Object-Oriented Software
The object-oriented design community has recently begun to collect so-called design patterns: cliches plus hints to their… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
Is this relevant?
1995
1995
Exact Geometric Computation in LEDA
Almost all geometric algorithms are based on the RealRAM model. Implementors often simply replace the exact real arithmetic of… (More)
  • figure 1
Is this relevant?