Compressed data structures: Dictionaries and data-aware measures-Reference-Cited by-同舟云学术

Compressed data structures: Dictionaries and data-aware measures

Published:2007-11 Issue:3 Volume:387 Page:313-331
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Gupta Ankur,Hon Wing-Kai,Shah Rahul,Vitter Jeffrey Scott

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference23 articles.

1. A. Andersson, M. Thorup, Tight(er) worst-case bounds on dynamic searching and priority queues, in: ACM Symposium on Theory of Computing, STOC, 2000

2. D. Blandford, G. Blelloch, Compact representations of ordered sets, in: Proceedings of the ACM–SIAM Symposium on Discrete Algorithms, January 2004

3. D. Blandford, G. Blelloch, Dictionaries using variable-length keys and data, with applications, in: Proceedings of the ACM–SIAM Symposium on Discrete Algorithms, January 2005

4. P. Beame, F. Fich, Optimal bounds for the predecessor problem, in: ACM Symposium on Theory of Computing, STOC, 1999, pp. 295–304

5. Membership in constant time and almost-minimum space;Brodnik;SIAM Journal on Computing,1999

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Learned Approach to Design Compressed Rank/Select Data Structures;ACM Transactions on Algorithms;2022-07-31

2. Efficient and compact representations of some non-canonical prefix-free codes;Theoretical Computer Science;2022-03

3. Adaptive Succinctness;Algorithmica;2021-10-04

4. A Hybrid Compressed Data Structure Supporting Rank and Select on Bit Sequences;2020 39th International Conference of the Chilean Computer Science Society (SCCC);2020-11-16

5. A Compact Rank/Select Data Structure for the Streaming Model;2019 38th International Conference of the Chilean Computer Science Society (SCCC);2019-11