Compressed data structures: Dictionaries and data-aware measures
暂无分享,去创建一个
[1] Roberto Grossi,et al. IP Address Lookup Made Fast and Simple , 1999, ESA.
[2] Dan E. Willard. New Trie Data Structures Which Support Very Fast Search Operations , 1984, J. Comput. Syst. Sci..
[3] Faith Ellen,et al. Optimal bounds for the predecessor problem , 1999, STOC '99.
[4] Ian H. Witten,et al. Data compression in full-text retrieval systems , 1993 .
[5] Gonzalo Navarro,et al. Rank and select revisited and extended , 2007, Theor. Comput. Sci..
[6] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[7] Mikkel Thorup,et al. Time-space trade-offs for predecessor search , 2006, STOC '06.
[8] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[9] Peter Elias,et al. Universal codeword sets and representations of the integers , 1975, IEEE Trans. Inf. Theory.
[10] Guy Joseph Jacobson,et al. Succinct static data structures , 1988 .
[11] Shmuel Tomi Klein,et al. Searching in compressed dictionaries , 2002, Proceedings DCC 2002. Data Compression Conference.
[12] Roberto Grossi,et al. Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) , 2000, STOC '00.
[13] Wing-Kai Hon,et al. Compressed Dictionaries: Space Measures, Data Sets, and Experiments , 2006, WEA.
[14] Peter van Emde Boas,et al. Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.
[15] Michael L. Fredman,et al. Surpassing the Information Theoretic Bound with Fusion Trees , 1993, J. Comput. Syst. Sci..
[16] Ian H. Witten,et al. Managing Gigabytes: Compressing and Indexing Documents and Images , 1999 .
[17] Guy E. Blelloch,et al. Compact representations of ordered sets , 2004, SODA '04.
[18] Rasmus Pagh. Low Redundancy in Static Dictionaries with O(1) Worst Case Lookup Time , 1999, ICALP.
[19] Mikkel Thorup,et al. Tight(er) worst-case bounds on dynamic searching and priority queues , 2000, STOC '00.
[20] Ian H. Witten,et al. Managing gigabytes (2nd ed.): compressing and indexing documents and images , 1999 .
[21] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees and multisets , 2002, SODA '02.
[22] Roberto Grossi,et al. Squeezing succinct data structures into entropy bounds , 2006, SODA '06.
[23] J. Ian Munro,et al. Membership in Constant Time and Almost-Minimum Space , 1999, SIAM J. Comput..
[24] Guy E. Blelloch,et al. Dictionaries using variable-length keys and data, with applications , 2005, SODA '05.
[25] D. Knuth,et al. Mathematics for the Analysis of Algorithms , 1999 .