Algorithms and Data Structure
45 Followers
Most cited papers in Algorithms and Data Structure
We present an elegant and simple to implement framework for performing out-of-core visualization and view-dependent refinement of large terrain surfaces. Contrary to the recent trend of increasingly elaborate algorithms for large-scale... more
1. Introduction. The nite element method for computing approximate solu-tions to linear elliptic partial di erential equations in the plane 12] is usually consid-ered to have three parts: subspace selection, matrix assembly, and matrix... more
Most software documentation typically describes the program at the algorithm and data-structure level. For large legacy systems, understanding the system's architecture is more important. The authors propose a method of reverse... more
Many modern programming languages support basic generics, sufficient to implement type-safe polymorphic containers. Some languages have moved beyond this basic support, and in doing so have enabled a broader, more powerful form of generic... more
A class of random recursive sequences (Y_n) with slowly varying variances as arising for parameters of random trees or recursive algorithms leads after normalizations to degenerate limit equations of the form X\stackrel{L}{=}X. For... more
All programmers should understand the concept of software families and know the techniques for constructing them. This paper suggests that classic problems, such as well-known algorithms and data structures, are good sources for examples... more
JIVE (Java interactive software visualization environment) is a system for the visualization of Java coded algorithms and data structures. It supports the rapid development of interactive animations through the adoption of an object... more
Area compaction of an orthogonal representation H states for computing a planar drawing of H with small area. Patrignani [On the complexity of orthogonal compaction, in: F. Dehne, A. Gupta, J.-R. Sack, R. Tamassia (Eds.), Algorithms and... more
Let (T,C) be a pair consisting of a tree T and a coloring C of its vertices. We say that C is a convex coloring if, for each color, the vertices in T with the same color induces a subtree of T. The convex recoloring problem (of trees) is... more