On the Redundancy of Succinct Data Structures
暂无分享,去创建一个
[1] Rajeev Raman,et al. Representing Trees of Higher Degree , 2005, Algorithmica.
[2] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[3] Anna Gál,et al. The cell probe complexity of succinct data structures , 2007, Theor. Comput. Sci..
[4] Roberto Grossi,et al. Squeezing succinct data structures into entropy bounds , 2006, SODA '06.
[5] Michael Hoffmann,et al. Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings , 2007, ESA.
[6] Rajeev Raman,et al. On the Size of Succinct Indices , 2007, ESA.
[7] Kunihiko Sadakane,et al. Practical Entropy-Compressed Rank/Select Dictionary , 2006, ALENEX.
[8] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[9] Rajeev Raman,et al. Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.
[10] Mikkel Thorup,et al. Time-space trade-offs for predecessor search , 2006, STOC '06.
[11] Giovanni Manzini,et al. Indexing compressed text , 2005, JACM.
[12] Rasmus Pagh. Low Redundancy in Static Dictionaries with Constant Query Time , 2001, SIAM J. Comput..
[13] Paolo Ferragina,et al. A simple storage scheme for strings achieving entropy bounds , 2007, SODA '07.
[14] Gonzalo Navarro,et al. Compressed representations of sequences and full-text indexes , 2007, TALG.
[15] Peter Bro Miltersen. Lower bounds on the size of selection and rank indexes , 2005, SODA '05.
[16] Fabrizio Luccio,et al. Structuring labeled trees for optimal succinctness, and beyond , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).
[17] Naila Rahman,et al. Engineering succinct DOM , 2008, EDBT '08.
[18] Alexander Golynski. Optimal lower bounds for rank and select indexes , 2007, Theor. Comput. Sci..
[19] Roberto Grossi,et al. Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching , 2005, SIAM J. Comput..
[20] S. Srinivasa Rao,et al. Succinct indexes for strings, binary relations and multi-labeled trees , 2007, SODA '07.
[21] Roberto Grossi,et al. High-order entropy-compressed text indexes , 2003, SODA '03.
[22] Alexander Golynski,et al. Upper and Lower Bounds for Text Upper and Lower Bounds for Text Indexing Data Structures , 2008 .