12453 search results - page 125 / 2491 » Concurrent Data Structures |
113
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents a general technique for optimally transforming any dynamic data structure D that operates on atomic and indivisible keys by constant-time comparisons,...
125
click to vote
ESA
2004
Springer
15 years 6 months ago
2004
Springer
The ability to represent and query continuously moving objects is important in many applications of spatio-temporal database systems. In this paper we develop data structures for ...
112
Voted
DAWAK
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We present a technique for discovering and representing changes between versions of data warehouse structures. We select a tree comparison algorithm, adapt it for the par...
160
click to vote
RSA
2006
15 years 2 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
105
Voted
POPL
1998
ACM
15 years 6 months ago
1998
ACM
Data structures with a hole, in other words data structures with an uninitialized field, are useful to write efficient programs: they enable us to construct functional data stru...