32545 search results - page 397 / 6509 » Data Structures and Algorithms |
195
Voted
DBPL
1999
Springer
15 years 11 months ago
1999
Springer
Applications have an increasing need to manage semistructured data such as data encoded in XML along with conventional structured data. We extend the structured object database ...
171
click to vote
ICALP
2004
Springer
16 years 7 days 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,...
224
click to vote
RSA
2006
15 years 6 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...
154
Voted
POPL
1998
ACM
15 years 11 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...
155
click to vote
STACS
2009
Springer
16 years 1 months ago
2009
Springer
We study data structures in the presence of adversarial noise. We want to encode a given object in a succinct data structure that enables us to efficiently answer specific queries...