11394 search results - page 1967 / 2279 » Self-Organizing Data Structures |
200
click to vote
ERSHOV
2003
Springer
16 years 15 hour ago
2003
Springer
By obfuscation we mean any efficient semantic-preserving transformation of computer programs aimed at bringing a program into such a form, which impedes the understanding of its al...
184
click to vote
ESA
2003
Springer
16 years 15 hour ago
2003
Springer
Abstract. We develop a simple combinatorial algorithm for computing the smallest enclosing ball of a set of points in high dimensional Euclidean space. The resulting code is in mos...
178
click to vote
ESA
2003
Springer
16 years 15 hour ago
2003
Springer
This paper presents a dynamic algorithm for the construction of the Euclidean Voronoi diagram of a set of convex objects in the plane. We consider first the Voronoi diagram of smo...
139
click to vote
EUROPAR
2003
Springer
16 years 14 hour ago
2003
Springer
Abstract. Trees are useful data structures, but to design efficient parallel programs over trees is known to be more difficult than to do over lists. Although several important tre...
163
click to vote
GD
2003
Springer
16 years 12 hour ago
2003
Springer
A graph with an ordered k-partition of the vertices is radial level planar if there is a strictly outward drawing on k concentric levels without crossings. Radial level planarity ...