Optimal Bounds for the Predecessor Problem and Related Problems, Journal of Computer and System Sciences, vol.65, issue.1, pp.38-72, 2002. ,
DOI : 10.1006/jcss.2002.1822
Compact dictionaries for variable-length keys and data with applications, ACM Transactions on Algorithms, vol.4, issue.2, pp.17-18, 2008. ,
DOI : 10.1145/1361192.1361194
Membership in Constant Time and Almost-Minimum Space, SIAM Journal on Computing, vol.28, issue.5, pp.1627-1640, 1999. ,
DOI : 10.1137/S0097539795294165
Are Bitvectors Optimal?, SIAM Journal on Computing, vol.31, issue.6, pp.1723-1744, 2002. ,
DOI : 10.1137/S0097539702405292
Efficient suffix trees on secondary storage, Proc. 7th ACM-SIAM SODA, pp.383-391, 1996. ,
Practical Rank/Select Queries over Arbitrary Sequences, Proc. 15th (SPIRE), 2008. ,
DOI : 10.1007/978-3-540-89097-3_18
Efficient Storage and Retrieval by Content and Address of Static Files, Journal of the ACM, vol.21, issue.2, pp.246-260, 1974. ,
DOI : 10.1145/321812.321820
On the number of bits required to implement an associative memory, 1971. ,
On searching compressed string collections cache-obliviously, Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '08, pp.181-190, 2008. ,
DOI : 10.1145/1376916.1376943
The string B-tree: a new data structure for string search in external memory and its applications, Journal of the ACM, vol.46, issue.2, pp.236-280, 1999. ,
DOI : 10.1145/301970.301973
Structuring labeled trees for optimal succinctness, and beyond, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05), pp.184-196, 2005. ,
DOI : 10.1109/SFCS.2005.69
Indexing compressed text, Journal of the ACM, vol.52, issue.4, pp.552-581, 2005. ,
DOI : 10.1145/1082036.1082039
The cell probe complexity of succinct data structures, Theoretical Computer Science, vol.379, issue.3, pp.405-417, 2007. ,
DOI : 10.1016/j.tcs.2007.02.047
A simple optimal representation for balanced parentheses, Theoretical Computer Science, vol.368, issue.3, pp.231-246, 2006. ,
DOI : 10.1016/j.tcs.2006.09.014
Succinct ordinal trees with level-ancestor queries, ACM Transactions on Algorithms, vol.2, issue.4, pp.510-534, 2006. ,
DOI : 10.1145/1198513.1198516
Optimal lower bounds for rank and select indexes, Theoretical Computer Science, vol.387, issue.3, pp.348-359, 2007. ,
DOI : 10.1016/j.tcs.2007.07.041
On the Size of Succinct Indices, Proc 15th ESA, pp.371-382, 2007. ,
DOI : 10.1007/978-3-540-75520-3_34
On the redundancy of succinct indices, Proc. 11th SWAT, pp.148-159, 2008. ,
Practical implementation of rank and select queries, Proc. 4th (WEA), pp.27-38, 2005. ,
High-order entropy-compressed text indexes, Proc. 14th ACM- SIAM SODA, pp.841-850, 2003. ,
When indexing equals compression: experiments with compressing suffix arrays and applications, Proc. 15th ACM-SIAM SODA, pp.636-645, 2004. ,
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching, SIAM Journal on Computing, vol.35, issue.2, pp.378-407, 2005. ,
DOI : 10.1137/S0097539702402354
Compressed data structures: Dictionaries and data-aware measures, Theoretical Computer Science, vol.387, issue.3, pp.313-331, 2007. ,
DOI : 10.1016/j.tcs.2007.07.042
Breaking a Time-and-Space Barrier in Constructing Full-Text Indices, Proc. 44th IEEE FOCS, pp.251-260, 2003. ,
DOI : 10.1137/070685373
Succinct Static Data Structures, 1989. ,
Lower bounds on the size of selection and rank indexes, Proc. ACM-SIAM SODA, pp.11-12, 2005. ,
Lower Bounds for Succinct Data Structures, Proc. 19th CPM, p.3, 2008. ,
DOI : 10.1007/978-3-540-69068-9_2
Succinct Representations of Permutations, Proc. 30th ICALP, pp.345-356, 2003. ,
DOI : 10.1007/3-540-45061-0_29
Succinct Representation of Balanced Parentheses and Static Trees, SIAM Journal on Computing, vol.31, issue.3, pp.762-776, 2001. ,
DOI : 10.1137/S0097539799364092
Space Efficient Suffix Trees, Journal of Algorithms, vol.39, issue.2, pp.205-222, 2001. ,
DOI : 10.1006/jagm.2000.1151
Compressed full-text indexes, ACM Computing Surveys, vol.39, issue.1, pp.1-261, 2007. ,
DOI : 10.1145/1216370.1216372
Practical Entropy-Compressed Rank/Select Dictionary, ALENEX. SIAM, 2007. ,
DOI : 10.1137/1.9781611972870.6
Low Redundancy in Static Dictionaries with Constant Query Time, SIAM Journal on Computing, vol.31, issue.2, pp.353-363, 2001. ,
DOI : 10.1137/S0097539700369909
Time-space trade-offs for predecessor search, Proc. 38th ACM STOC, pp.232-240, 2006. ,
Succinct indexable dictionaries, with applications to representing k-ary trees, prefix sums and multisets, ACM Transactions on Algorithms, vol.3, issue.4, 2007. ,
Design and implementation of an efficient priority queue, Mathematical Systems Theory, vol.22, issue.1, pp.99-127, 1977. ,
DOI : 10.1007/BF01683268
Broadword Implementation of Rank/Select Queries, Proc. 7th WEA, pp.154-168, 2008. ,
DOI : 10.1007/978-3-540-68552-4_12