Sciweavers

SPIRE
2010
Springer
13 years 10 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro
WADS
2001
Springer
106views Algorithms» more  WADS 2001»
14 years 3 months ago
Succinct Dynamic Data Structures
Abstract. We develop succinct data structures to represent (i) a sequence of values to support partial sum and select queries and update (changing values) and (ii) a dynamic array ...
Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
DCC
2010
IEEE
14 years 6 months ago
Advantages of Shared Data Structures for Sequences of Balanced Parentheses
We propose new data structures for navigation in sequences of balanced parentheses, a standard tool for representing compressed trees. The most striking property of our approach is...
Simon Gog, Johannes Fischer