{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T04:42:40Z","timestamp":1725856960395},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319388502"},{"type":"electronic","value":"9783319388519"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-38851-9_14","type":"book-chapter","created":{"date-parts":[[2016,5,31]],"date-time":"2016-05-31T11:33:54Z","timestamp":1464694434000},"page":"201-216","source":"Crossref","is-referenced-by-count":0,"title":["Engineering Hybrid DenseZDDs"],"prefix":"10.1007","author":[{"given":"Taito","family":"Lee","sequence":"first","affiliation":[]},{"given":"Shuhei","family":"Denzumi","sequence":"additional","affiliation":[]},{"given":"Kunihiko","family":"Sadakane","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,6,1]]},"reference":[{"key":"14_CR1","doi-asserted-by":"crossref","unstructured":"Arroyuelo, D., C\u00e1novas, R., Navarro, G., Sadakane, K.: Succinct trees in practice. In: Proceedings of the 11th Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 84\u201397. SIAM Press (2010)","DOI":"10.1137\/1.9781611972900.9"},{"issue":"8","key":"14_CR2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/978-3-319-07959-2_16","volume-title":"Experimental Algorithms","author":"S Denzumi","year":"2014","unstructured":"Denzumi, S., Kawahara, J., Tsuda, K., Arimura, H., Minato, S.-I., Sadakane, K.: DenseZDD: a compact and fast index for families of sets. In: Gudmundsson, J., Katajainen, J. (eds.) SEA 2014. LNCS, vol. 8504, pp. 187\u2013198. Springer, Heidelberg (2014)"},{"key":"14_CR4","unstructured":"Hansen, E.R., Rao, S.S., Tiedemann, P.: Compressing binary decision diagrams. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), pp. 799\u2013800. ACM (2008)"},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/978-3-642-30850-5_20","volume-title":"Experimental Algorithms","author":"S Joannou","year":"2012","unstructured":"Joannou, S., Raman, R.: Dynamizing succinct tree representations. In: Klasing, R. (ed.) SEA 2012. LNCS, vol. 7276, pp. 224\u2013235. Springer, Heidelberg (2012)"},{"issue":"4","key":"14_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1109\/43.494701","volume":"15","author":"S Minato","year":"1996","unstructured":"Minato, S.: Fast factorization method for implicit cube set representation. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 15(4), 377\u2013384 (1996)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circ. Syst."},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Minato, S.-I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceeding of Design Automation Conference (DAC 1993), pp. 272\u2013277. IEEE (1993)","DOI":"10.1145\/157485.164890"},{"issue":"2","key":"14_CR8","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1007\/s100090100038","volume":"3","author":"S-I Minato","year":"2001","unstructured":"Minato, S.-I.: Zero-suppressed BDDs and their applications. J. Softw. Tools Technol. Transf. 3(2), 156\u2013170 (2001)","journal-title":"J. Softw. Tools Technol. Transf."},{"key":"14_CR9","unstructured":"Minato, S.-I.: SAPPORO BDD package. Hokkaido University (2011). unreleased"},{"key":"14_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1007\/978-3-540-75549-4_10","volume-title":"Knowledge Discovery in Inductive Databases","author":"S-I Minato","year":"2007","unstructured":"Minato, S.-I., Arimura, H.: Frequent pattern mining and knowledge indexing based on zero-suppressed BDDs. In: D\u017eeroski, S., Struyf, J. (eds.) KDID 2006. LNCS, vol. 4747, pp. 152\u2013169. Springer, Heidelberg (2007)"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Minato, S.-I., Ishiura, N., Yajima, S.: Shared binary decision diagram with attributed edges for efficient boolean function manipulation. In: Proceedings of the 27th Design Automation Conference (DAC 1990), pp. 52\u201357. IEEE (1990)","DOI":"10.1145\/123186.123225"},{"key":"14_CR12","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-68125-0_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S-I Minato","year":"2008","unstructured":"Minato, S.-I., Uno, T., Arimura, H.: LCM over ZBDDs: fast generation of very large-scale frequent itemsets using a compact graph-based representation. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 234\u2013246. Springer, Heidelberg (2008)"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Navarro, G., Sadakane, K.: Fully-functional static and dynamic succinct trees. ACM Trans. Algorithms, 10(3) (2014). Article No. 16. doi: 10.1145\/2601073","DOI":"10.1145\/2601073"},{"issue":"4","key":"14_CR14","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/1290672.1290680","volume":"3","author":"R Raman","year":"2007","unstructured":"Raman, R., Raman, V., Rao, S.S.: Succinct indexable dictionaries with applications to encoding k-ary trees, prefix sums and multisets. ACM Trans. Algorithms 3(4), 43 (2007)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-38851-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T06:42:51Z","timestamp":1600670571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-38851-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319388502","9783319388519"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-38851-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}