Efficient implementation of rank and select functions for succinct representation

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 315-327

  Kim, Dong Kyue ^a   Na, Joong Chae ^b   Kim, Ji Eun ^a   Park, Kunsoo ^b  

^a Pusan National University   (South Korea)

^b Seoul National University   (South Korea)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES;

BIT-STRING; CLARK'S ALGORITHM; DISCRETE OBJECTS; SUCCINCT REPRESENTATION;

FUNCTIONS;

EID: 24944553353     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_28     Document Type: Conference Paper

References (16)

1. D. R. Clark. Compact Pat Trees. PhD thesis, University of Waterloo, Waterloo, 1988.
2. P. Ferragina and G. Manzini. Opportunistic data structures with applications. FOCS'00, pages 390-398, 2000.
3. P. Ferragina and G. Manzini. An experimental study of an opportunistic index. SODA'01, pages 269-278, 2001.
4. R. Grossi, A. Gupta, and J. S. Vitter. High-order entropy-compressed text indexes. SODA'03, pages 841-850, 2003.
5. R. Grossi and J. S. Vitter. Compressed suffix arrays and suffix trees with applications to text indexing and string matching. STOC'00, pages 397-406, 2000.
6. W. K. Hon, K. Sadakane, and W. K. Sung. Breaking a time-and-space barrier in constructing full-text indices. FOCS'03, pages 251-260, 2003.
7. G. Jacobson. Succinct Static Data Structures. PhD thesis, Carnegie Mellon University, Pittsburgh, 1988.
8. G. Jacobson. Space-efficient static trees and graphs. FOCS'89, pages 549-554, 1989.
9. P. B. Miltersen. Lower bounds on the size of selection and rank indexes. SODA '05, pages 11-12, 2005.
10. J. I. Munro, R. Raman, V. Raman, and S. S. Rao. Succinct representations of permutations. ICALP'03, pages 345-356, 2003.
11. J. I. Munro and V. Raman. Succinct representation of balanced parentheses and static trees. SIAM J. on Comp., 31(3): 762-776, 2001.
12. J. I. Munro, V. Raman, and S.S. Rao. Space efficient suffix trees. J. Alg., 39(2):205-222, 2001.
13. J. I. Munro and S. S. Rao. Succinct representations of functions. ICALP'04, pages 1006-1015, 2004.
14. R. Raman and S. S. Rao. Succinct dynamic dictionaries and trees. ICALP'03, pages 357-368, 2003.
15. K. Sadakane. Succinct representations of Icp information and improvements in the compressed suffix arrays. SODA'02, pages 225-232, 2002.
16. G. Turan. Succinct representations of graphs. Disc. App. Math., 8:289-294, 1984.