{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T22:41:23Z","timestamp":1785883283667,"version":"3.56.0"},"reference-count":43,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2013,2,1]],"date-time":"2013-02-01T00:00:00Z","timestamp":1359676800000},"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":[[2013,2]]},"DOI":"10.1109\/tcad.2012.2217963","type":"journal-article","created":{"date-parts":[[2013,1,21]],"date-time":"2013-01-21T19:09:44Z","timestamp":1358795384000},"page":"275-288","source":"Crossref","is-referenced-by-count":48,"title":["Graph-Pair Decision Diagram Construction for Topological Symbolic Circuit Analysis"],"prefix":"10.1109","volume":"32","author":[{"given":"Guoyong","family":"Shi","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2011.5938170"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/APCCAS.2010.5774855"},{"key":"ref33","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1145\/157485.164890","article-title":"zero-suppressed bdds for set manipulation in combinatorial problems","author":"minato","year":"1993","journal-title":"30th ACM\/IEEE Design Automation Conference"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2010.5654333"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/123186.123222"},{"key":"ref30","first-page":"541","article-title":"Hierarchical graph reduction approach to symbolic circuit analysis with data sharing and cancellation-free properties","author":"song","year":"2012","journal-title":"Proc ASPDAC"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2009.5118434"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.900170"},{"key":"ref35","year":"2006","journal-title":"HSPICE Simulation and Analysis User Guide"},{"key":"ref34","year":"0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/81.382473"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/NEWCAS.2012.6328983"},{"key":"ref11","first-page":"806","article-title":"A family of matroid intersection algorithms for the computation of approximated symbolic network functions","author":"wambacq","year":"1996","journal-title":"Proc Int Symp Circuits Syst"},{"key":"ref12","first-page":"798","article-title":"Symbolic analysis tools: The state-of-the-art","author":"fernndez","year":"1996","journal-title":"Proc IEEE Int Symp Circuits Syst"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/81.526681"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/81.762925"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1023\/A:1015094011107"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.1997.643562"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1986.1676819"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/43.822616"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2010.2067791"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/43.930996"},{"key":"ref4","first-page":"66","article-title":"Symbolic modeling and analysis of analog integrated circuits","author":"sommer","year":"1999","journal-title":"Proc Eur Conf Circuit Theory Design"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1109\/TCT.1965.1082385","article-title":"A simple algorithm for listing all the trees of a graph","volume":"ct 12","author":"minty","year":"1965","journal-title":"IEEE Trans Circuit Theory"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/5.265355"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024799"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2011.5722183"},{"key":"ref5","author":"yang","year":"2006","journal-title":"Symbolic Sensitivity Analysis Techniques and Applications in Analog Circuit Synthesis"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00195622"},{"key":"ref7","author":"lin","year":"1991","journal-title":"Symbolic Network Analysis"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1982.1051852"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/4.364450"},{"key":"ref1","author":"gray","year":"2001","journal-title":"Analysis and Design of Analog Integrated Circuits"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357985"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.1992.230321"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/APCCAS.2006.342438"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TCT.1971.1083223"},{"key":"ref24","first-page":"504","article-title":"The modified nodal approach to network analysis","volume":"cas 22","author":"ho","year":"1975","journal-title":"IEEE Trans Circuits Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/MWSCAS.2011.6026581"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/43.662681"},{"key":"ref26","first-page":"335","article-title":"Symbolic network analysis with the valid trees and the valid tree-pairs","author":"yin","year":"2001","journal-title":"Proc IEEE Int Symp Circuit Syst"},{"key":"ref43","author":"chen","year":"1976","journal-title":"Applied Graph Theory Graphs and Electrical Networks"},{"key":"ref25","author":"mayeda","year":"1972","journal-title":"Graph Theory"}],"container-title":["IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/43\/6416083\/06416104.pdf?arnumber=6416104","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,29]],"date-time":"2021-11-29T20:40:24Z","timestamp":1638218424000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6416104\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,2]]},"references-count":43,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tcad.2012.2217963","relation":{},"ISSN":["0278-0070","1937-4151"],"issn-type":[{"value":"0278-0070","type":"print"},{"value":"1937-4151","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,2]]}}}