1. Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers C-35(8), 677–691 (1986)
2. Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S., Sadakane, K.: A compact and fast index structure for families of sets. Tech. rep., TCS Technical Report Series A, TCS-TR-A-14-71, Division of Computer Science, Hokkaido University (2014),
http://www-alg.ist.hokudai.ac.jp/tra.html
3. Denzumi, S., Yoshinaka, R., Arimura, H., Minato, S.: Notes on sequence binary decision diagrams: Relationship to acyclic automata and complexities of binary set operations. In: Prague Stringology Conference 2011, Prague, pp. 147–161 (2011)
4. Elias, P.: Universal codeword sets and representation of the integers. IEEE Transactions on Information Theory IT-21(2), 194–203 (1975)
5. Hansen, E.R., Rao, S.S., Tiedemann, P.: Compressing binary decision diagrams. In: 18th European Conference on Artificial Intelligence, pp. 799–800 (2008)