{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:25:24Z","timestamp":1747196724392,"version":"3.40.5"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131856"},{"type":"electronic","value":"9783319131863"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13186-3_44","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"494-503","source":"Crossref","is-referenced-by-count":0,"title":["A General Framework for Parallel Unary Operations on ZDDs"],"prefix":"10.1007","author":[{"given":"Shogo","family":"Takeuchi","sequence":"first","affiliation":[]},{"given":"Takahisa","family":"Toda","sequence":"additional","affiliation":[]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDs. In: The 1997 European Conference on Design and Test, Paris, France, pp. 224\u2013228, March 1997","DOI":"10.1109\/EDTC.1997.582363"},{"key":"44_CR2","volume-title":"The Art of Computer Programming","author":"D Knuth","year":"2011","unstructured":"Knuth, D.: The Art of Computer Programming, vol. 4a. Addison-Wesley Professional, New Jersey (2011)"},{"key":"44_CR3","unstructured":"Sekine, K., Imai, H.: Counting the number of paths in a graph via BDDs. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E80-A, 682\u2013688 (1997)"},{"issue":"3","key":"44_CR4","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/TR.2007.898572","volume":"56","author":"G Hardy","year":"2007","unstructured":"Hardy, G., Lucet, C., Limnios, N.: K-terminal network reliability measures with binary decision diagrams. IEEE Trans. Reliab. 56(3), 506\u2013515 (2007)","journal-title":"IEEE Trans. Reliab."},{"issue":"1","key":"44_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TSG.2013.2288976","volume":"5","author":"T Inoue","year":"2014","unstructured":"Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S.I., Hayashi, Y.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102\u2013111 (2014)","journal-title":"IEEE Trans. Smart Grid"},{"key":"44_CR6","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1527\/tjsai.22.165","volume":"22","author":"S Minato","year":"2007","unstructured":"Minato, S., Arimura, H.: Frequent closed item set mining based on zero-suppressed BDDs. Trans. Jpn. Soc. Artif. Intell. 22, 165\u2013172 (2007)","journal-title":"Trans. Jpn. Soc. Artif. Intell."},{"key":"44_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-540-75549-4_10","volume-title":"Knowledge Discovery in Inductive Databases","author":"S Minato","year":"2007","unstructured":"Minato, S., 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":"44_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-68125-0_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S Minato","year":"2008","unstructured":"Minato, S., 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)"},{"issue":"2","key":"44_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10115-009-0252-9","volume":"24","author":"E Loekito","year":"2010","unstructured":"Loekito, E., Bailey, J., Pei, J.: A binary decision diagram based approach for mining frequent subsequences. Knowl. Inf. Syst. 24(2), 235\u2013268 (2010)","journal-title":"Knowl. Inf. Syst."},{"key":"44_CR10","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/j.entcs.2013.07.009","volume":"296","author":"T Dijk van","year":"2013","unstructured":"van Dijk, T., Laarman, A., van de Pol, J.: Multi-core BDD operations for symbolic reachability. Electron. Notes Theor. Comput. Sci. 296, 127\u2013143 (2013)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"44_CR11","doi-asserted-by":"crossref","unstructured":"Elbayoumi, M., Hsiao, M.S., ElNainay, M.: A novel concurrent cache-friendly binary decision diagram construction for multi-core platforms. In: Design, Automation Test in Europe Conference Exhibition (DATE), pp. 1427\u20131430, March 2013","DOI":"10.7873\/DATE.2013.291"},{"key":"44_CR12","doi-asserted-by":"crossref","unstructured":"Toda, T.: Hypergraph transversal computation with binary decision diagrams. In: 12th International Symposium on Experimental Algorithms, Rome, Italy, June 2013","DOI":"10.1007\/978-3-642-38527-8_10"},{"key":"44_CR13","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: 30th ACM\/IEEE Design Autiomation Conference (DAC-93), Dallas, Texas, USA, pp. 272\u2013277, Jun 1993","DOI":"10.1145\/157485.164890"},{"issue":"3","key":"44_CR14","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1008681625346","volume":"13","author":"O Schr\u00f6er","year":"1998","unstructured":"Schr\u00f6er, O., Wegener, I.: The theory of zero-suppressed BDDs and the number of knight\u2019s tours. Formal Meth. Syst. Des. 13(3), 235\u2013253 (1998)","journal-title":"Formal Meth. Syst. Des."},{"key":"44_CR15","volume-title":"The Art of Multiprocessor Programming","author":"M Herlihy","year":"2008","unstructured":"Herlihy, M., Shavit, N.: The Art of Multiprocessor Programming. Morgan Kaufmann Publishers Inc., San Francisco (2008)"}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13186-3_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:11:13Z","timestamp":1747174273000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-13186-3_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131856","9783319131863"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13186-3_44","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}