@techreport{oai:ipsj.ixsq.nii.ac.jp:00068031,
 author = {馬場, 雅大 and 小野, 廣隆 and 定兼, 邦彦 and 山下, 雅史 and Masahiro, Baba and Hirotaka, Ono and Kunihiko, Sadakane and Masafumi, Yamashita},
 issue = {1},
 month = {Feb},
 note = {大規模なデータを効率よく扱うために圧縮されたデータ上で高速な操作を行える簡潔データ構造が提案されてきた．本稿ではパトリシアトライなどに使われる全二分木に焦点を当てる．提案する全二分木の簡潔表現のサイズは n+o(n) ビットであり，右の子へ巡回するといった操作を定数時間で行うことができる．また接尾辞木 (ST) を全二分木に変換することで圧縮可能であることを示す．, To take large-scale data efficiently, succinct data structures that support highspeed operations on compressed data have been developed. In this paper, we focus on full binary trees which are used as patricia tries. We propose for a succinct data structure whose size is n+o(n) bits. This representation enables constant time operations such as traversing from a internal node to its right child node. Then, we show that a suffix tree (ST) is compressible by converting it to a full binary tree.},
 title = {全二分木の簡潔な表現},
 year = {2010}
}