1396 search results - page 3 / 280 » Succinct Dynamic Data Structures |
CORR
2008
Springer
13 years 6 months ago
2008
Springer
SODA
2010
ACM
13 years 4 months ago
2010
ACM
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
SODA
2001
ACM
13 years 7 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...
WADS
2009
Springer
14 years 26 days ago
2009
Springer
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
ICALP
2009
Springer
14 years 6 months ago
2009
Springer
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...