{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:35:17Z","timestamp":1725744917419},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642404498"},{"type":"electronic","value":"9783642404504"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_62","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"731-742","source":"Crossref","is-referenced-by-count":4,"title":["Z-Skip-Links for Fast Traversal of ZDDs Representing Large-Scale Sparse Datasets"],"prefix":"10.1007","author":[{"given":"Shin-Ichi","family":"Minato","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"62_CR1","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"27","author":"S.B. Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Transactions on Computers\u00a0C-27(6), 509\u2013516 (1978)","journal-title":"IEEE Transactions on Computers C-"},{"issue":"8","key":"62_CR2","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"-35","author":"R.E. Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers\u00a0C-35(8), 677\u2013691 (1986)","journal-title":"IEEE Transactions on Computers C"},{"key":"62_CR3","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDs. In: Proc. of ACM\/IEEE European Design and Test Conference (ED&TC 1997), pp. 224\u2013228 (1997)"},{"key":"62_CR4","doi-asserted-by":"crossref","unstructured":"Goethals, B., Zaki, M.J.: Frequent itemset mining dataset repository. In: Frequent Itemset Mining Implementations (FIMI 2003) (2003), \n                  \n                    http:\/\/fimi.cs.helsinki.fi\/","DOI":"10.1145\/1007730.1007744"},{"key":"62_CR5","doi-asserted-by":"crossref","unstructured":"Minato, S.I.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proc. of 30th ACM\/IEEE Design Automation Conference (DAC 1993), pp. 272\u2013277 (1993)","DOI":"10.1145\/157485.164890"},{"key":"62_CR6","unstructured":"Ishihata, M., Kameya, Y., Sato, T., Minato, S.: Propositionalizing the EM algorithm by BDDs. In: Proc. of 18th International Conference on Inductive Logic Programming (ILP 2008), p. 9 (2008)"},{"key":"62_CR7","unstructured":"Knuth, D.E.: The Art of Computer Programming: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.\u00a04, fascicle 1. Addison-Wesley (2009)"},{"key":"62_CR8","doi-asserted-by":"crossref","unstructured":"Loekit, E., Bailey, J.: Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams. In: Proc. The Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2006), pp. 307\u2013316 (2006)","DOI":"10.1145\/1150402.1150438"},{"key":"62_CR9","unstructured":"Minato, S., Satoh, K., Sato, T.: Compiling bayesian networks by symbolic probability calculation based on zero-suppressed BDDs. In: Proc. of 20th International Joint Conference of Artificial Intelligence (IJCAI 2007), pp. 2550\u20132555 (2007)"},{"key":"62_CR10","doi-asserted-by":"crossref","unstructured":"Minato, S.-I.: Z-skip-links for fast zdd traversal in handling large-scale sparse datasets (revised ed.). Hokkaido University, Division of Computer Science. TCS Technical Reports, TCS-TR-A-13-66 (2013), \n                  \n                    http:\/\/www-alg.ist.hokudai.ac.jp\/tra.html\/","DOI":"10.1007\/978-3-642-40450-4_62"},{"key":"62_CR11","series-title":"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.-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.\u00a05012, pp. 234\u2013246. Springer, Heidelberg (2008)"},{"issue":"6","key":"62_CR12","first-page":"668","volume":"33","author":"W. Pugh","year":"1990","unstructured":"Pugh, W.: Skip lists: A probabilistic alternative to balanced trees. Algorithms and Data Structures\u00a033(6), 668\u2013676 (1990)","journal-title":"Algorithms and Data Structures"},{"issue":"16","key":"62_CR13","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ipl.2012.05.007","volume":"112","author":"R. Yoshinaka","year":"2012","unstructured":"Yoshinaka, R., Kawahara, J., Denzumi, S., Arimura, H., Minato, S.-I.: Counterexamples to the long-standing conjecture on the complexity of bdd binary operations. Information Processing Letters\u00a0112(16), 636\u2013640 (2012)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_62","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:50:44Z","timestamp":1558011044000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}