11213 search results - page 362 / 2243 » Low-contention data structures |
185
Voted
ICALP
2001
Springer
15 years 11 months ago
2001
Springer
Abstract. In this paper we investigate automated methods for externalizing internal memory data structures. We consider a class of balanced trees that we call weight-balanced parti...
167
click to vote
ICSE
1999
IEEE-ACM
15 years 11 months ago
1999
IEEE-ACM
Many approaches to support (semi-automatic) identification of objects in legacy code take the data structures as starting point for candidate classes. Unfortunately, legacy data ...
197
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
We provide the first linear-space data structure with provable sublinear query time for exact point-topoint shortest path queries in planar graphs. We prove that for any planar gr...
150
click to vote
CGF
2002
15 years 6 months ago
2002
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures...
176
click to vote
ML
2010
ACM
15 years 5 months ago
2010
ACM
In several domains it is common to have data from different, but closely related problems. For instance, in manufacturing, many products follow the same industrial process but with...