Succinct Dynamic Cardinal Trees with Constant Time Operations for Small Alphabet
暂无分享,去创建一个
[1] Wing-Kai Hon,et al. Succinct Data Structures for Searchable Partial Sums , 2003, ISAAC.
[2] Gonzalo Navarro,et al. Compressed representations of sequences and full-text indexes , 2007, TALG.
[3] Niklaus Wirth,et al. Algorithms and Data Structures , 1989, Lecture Notes in Computer Science.
[4] Venkatesh Raman,et al. Representing dynamic binary trees succinctly , 2001, SODA '01.
[5] Diego Arroyuelo,et al. An Improved Succinct Representation for Dynamic k-ary Trees , 2008, CPM.
[6] Rajeev Raman,et al. Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets , 2007, ACM Trans. Algorithms.
[7] Rajeev Raman,et al. Universal Succinct Representations of Trees? , 2009, ICALP.
[8] J. Ian Munro,et al. Succinct representation of dynamic trees , 2011, Theor. Comput. Sci..
[9] Rajeev Raman,et al. Representing Trees of Higher Degree , 2005, Algorithmica.
[10] D. Knuth,et al. Concrete Math , 1988 .
[11] Kunihiko Sadakane,et al. Ultra-succinct representation of ordered trees , 2007, SODA '07.
[12] Wing-Kai Hon,et al. Compressed indexes for dynamic text collections , 2007, TALG.
[13] Rajeev Raman,et al. Succinct Dynamic Data Structures , 2001, WADS.
[14] Rajeev Raman,et al. Succinct Dynamic Dictionaries and Trees , 2003, ICALP.
[15] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[16] Erik D. Demaine,et al. Resizable Arrays in Optimal Time and Space , 1999, WADS.
[17] Ian H. Witten,et al. Bonsai: A compact representation of trees , 1993, Softw. Pract. Exp..