Compressed Tree Representations
暂无分享,去创建一个
[1] J. Ian Munro,et al. A Uniform Paradigm to Succinctly Encode Various Families of Trees , 2012, Algorithmica.
[2] Hsueh-I Lu,et al. Balanced parentheses strike back , 2008, TALG.
[3] Stelios Joannou,et al. Dynamizing Succinct Tree Representations , 2012, SEA.
[4] Gonzalo Navarro,et al. Implementing the LZ-index: Theory versus practice , 2009, JEAL.
[5] Gonzalo Navarro,et al. Succinct Trees in Practice , 2010, ALENEX.
[6] Guy Jacobson,et al. Space-efficient static trees and graphs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Rajeev Raman,et al. Succinct ordinal trees with level-ancestor queries , 2004, SODA '04.
[8] J. Ian Munro,et al. Succinct Representation of Balanced Parentheses and Static Trees , 2002, SIAM J. Comput..
[9] Kunihiko Sadakane,et al. Fully Functional Static and Dynamic Succinct Trees , 2009, TALG.
[10] Kunihiko Sadakane,et al. Compressed Suffix Trees with Full Functionality , 2007, Theory of Computing Systems.
[11] Hiroshi Sakamoto,et al. Fully-Online Grammar Compression , 2013, SPIRE.
[12] David Richard Clark,et al. Compact pat trees , 1998 .
[13] Wing-Kai Hon,et al. Compressed indexes for dynamic text collections , 2007, TALG.
[14] Naila Rahman,et al. A simple optimal representation for balanced parentheses , 2006, Theor. Comput. Sci..
[15] Rajeev Raman,et al. Universal Succinct Representations of Trees? , 2009, ICALP.
[16] Rajeev Raman,et al. Representing Trees of Higher Degree , 2005, Algorithmica.
[17] Kunihiko Sadakane,et al. Ultra-succinct representation of ordered trees with applications , 2012, J. Comput. Syst. Sci..
[18] Rajeev Raman,et al. Succinct representations of permutations and functions , 2011, Theor. Comput. Sci..
[19] S. Srinivasa Rao,et al. Succinct ordinal trees based on tree covering , 2012, TALG.
[20] Hiroki Arimura,et al. DenseZDD: A Compact and Fast Index for Families of Sets , 2014, SEA.