{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T13:09:25Z","timestamp":1754485765430},"reference-count":31,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."],"published-print":{"date-parts":[[2011,1]]},"DOI":"10.1109\/tcad.2010.2069290","type":"journal-article","created":{"date-parts":[[2010,12,22]],"date-time":"2010-12-22T01:24:58Z","timestamp":1292981098000},"page":"31-44","source":"Crossref","is-referenced-by-count":5,"title":["Determining the Number of Paths in Decision Diagrams by Using Autocorrelation Coefficients"],"prefix":"10.1109","volume":"30","author":[{"given":"Osnat","family":"Keren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ilya","family":"Levin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radomir S.","family":"Stankovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref31","author":"yanushkevich","year":"2006","journal-title":"Decision Diagram Techniques for Micro-and Nanoelectronic Design Handbook"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/43.31549"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2003.1299881"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICVD.1995.512082"},{"key":"ref12","author":"karpovsky","year":"1976","journal-title":"Finite Orthogonal Series in the Design of Digital Devices"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2003.1197126"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.70811"},{"key":"ref15","first-page":"137","article-title":"Linearization of functions represented as a set of disjoint cubes at the autocorrelation domain","author":"keren","year":"2006","journal-title":"Proc 7th Int Workshop Boolean Probl"},{"key":"ref16","first-page":"79","article-title":"Reduction of the number of paths in binary decision diagrams by linear transformation of variables","author":"keren","year":"2006","journal-title":"Proc 7th Int Workshop Boolean Probl"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DATE.2001.915077"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.1997.628892"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/43.845077"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ISMVL.2011.15"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/43.905674"},{"key":"ref27","first-page":"31","article-title":"average path length as a paradigm for the fast evaluation of functions represented by binary decision diagrams","author":"sasao","year":"2002","journal-title":"Proc 1st Int Symp New Paradigm VLSI Comput"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/NANOARCH.2008.4585791"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/PACRIM.1999.799502"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.63.052315"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/43.833206"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/SBCCI.2002.1137683"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2003.819427"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2005.137"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.852662"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/12.537122"},{"key":"ref20","author":"miller","year":"2001","journal-title":"Spectral Techniques in VLSI Comput -Aided Design"},{"key":"ref22","first-page":"437","article-title":"exact and heuristic minimization of the average path length in decision diagrams","volume":"11","author":"nagayama","year":"2005","journal-title":"J Multi-Valued Logic Soft Comput"},{"key":"ref21","first-page":"242","article-title":"fast heuristic minimization of exclusive-sums-of-products","author":"mishchenko","year":"2001","journal-title":"Proc Reed-Muller Workshop"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2002.996778"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1997.608994"},{"key":"ref26","first-page":"42","article-title":"dynamic variable ordering for ordered binary decision diagrams","author":"rudell","year":"1993","journal-title":"Proc Int Conf Comput -Aided Design"},{"key":"ref25","first-page":"69","article-title":"methods for calculating autocorrelation coefficients","author":"rice","year":"2000","journal-title":"Proc 4th IWSB"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/5671535\/05671542.pdf?arnumber=5671542","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T00:45:36Z","timestamp":1633913136000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5671542\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1]]},"references-count":31,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2010.2069290","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1]]}}}