{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T20:11:09Z","timestamp":1770754269688,"version":"3.50.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,11,2]],"date-time":"2020-11-02T00:00:00Z","timestamp":1604275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"DARPA IDEA\/SPAWAR","award":["N660011824048"],"award-info":[{"award-number":["N660011824048"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,11,2]]},"DOI":"10.1145\/3400302.3415685","type":"proceedings-article","created":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T01:17:48Z","timestamp":1608254268000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["A general approach for identifying hierarchical symmetry constraints for analog circuit layout"],"prefix":"10.1145","author":[{"given":"Kishor","family":"Kunal","sequence":"first","affiliation":[{"name":"University of Minnesota"}]},{"given":"Jitesh","family":"Poojary","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]},{"given":"Tonmoy","family":"Dhar","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]},{"given":"Meghna","family":"Madhusudan","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]},{"given":"Ramesh","family":"Harjani","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]},{"given":"Sachin S.","family":"Sapatnekar","sequence":"additional","affiliation":[{"name":"University of Minnesota"}]}],"member":"320","published-online":{"date-parts":[[2020,12,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1989.572629"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.1999.748181"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717781"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3323471"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.511572"},{"key":"e_1_3_2_1_6_1","first-page":"47","volume-title":"ISPD","author":"Eick M.","year":"2010","unstructured":"M. Eick , generation of hierarchical placement rules for analog integrated circuits,\" in Proc . ISPD , pp. 47 -- 54 , 2010 . M. Eick, et al., \"Automatic generation of hierarchical placement rules for analog integrated circuits,\" in Proc. ISPD, pp. 47--54, 2010."},{"key":"e_1_3_2_1_7_1","volume-title":"DATE","author":"Kunal K.","year":"2020","unstructured":"K. Kunal , : Graph convolutional network based automated netlist annotation for analog circuits,\" Proc . DATE , 2020 . K. Kunal, et al., \"GANA: Graph convolutional network based automated netlist annotation for analog circuits,\" Proc. DATE, 2020."},{"key":"e_1_3_2_1_8_1","first-page":"193","article-title":"S3DET: Detecting system symmetry constraints for analog circuits with graph similarity","author":"Liu M.","year":"2020","unstructured":"M. Liu , , \" S3DET: Detecting system symmetry constraints for analog circuits with graph similarity ,\" in Proc. ASP-DAC , pp. 193 -- 198 , 2020 . M. Liu, et al., \"S3DET: Detecting system symmetry constraints for analog circuits with graph similarity,\" in Proc. ASP-DAC, pp. 193--198, 2020.","journal-title":"Proc. ASP-DAC"},{"key":"e_1_3_2_1_9_1","first-page":"223","volume-title":"ISSCC","author":"Wong K.-L. J.","year":"2006","unstructured":"K.-L. J. Wong and C.-K. K. Yang , \"A serial-link transceiver with transition equalization,\" in Proc . ISSCC , pp. 223 -- 232 , 2006 . K.-L. J. Wong and C.-K. K. Yang, \"A serial-link transceiver with transition equalization,\" in Proc. ISSCC, pp. 223--232, 2006."},{"key":"e_1_3_2_1_10_1","unstructured":"\"ALIGN: Automatic circuit annotation.\" https:\/\/github.com\/ALIGN-analoglayout\/hierarchical-symmetry.  \"ALIGN: Automatic circuit annotation.\" https:\/\/github.com\/ALIGN-analoglayout\/hierarchical-symmetry."},{"key":"e_1_3_2_1_11_1","first-page":"31","volume-title":"DAC","author":"Ohlrich M.","year":"1993","unstructured":"M. Ohlrich , : Identifying subcircuits using a fast subgraph algorithm,\" in Proc . DAC , pp. 31 -- 37 , 1993 . M. Ohlrich, et al., \"SubGemini: Identifying subcircuits using a fast subgraph algorithm,\" in Proc. DAC, pp. 31--37, 1993."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2012.2204993"},{"key":"e_1_3_2_1_13_1","first-page":"801","volume-title":"CICC","author":"Chehrazi S.","year":"2005","unstructured":"S. Chehrazi , A 6. 5 GHz wideband CMOS low noise amplifier for multi-band use,\" in Proc . CICC , pp. 801 -- 804 , 2005 . S. Chehrazi, et al., \"A 6.5 GHz wideband CMOS low noise amplifier for multi-band use,\" in Proc. CICC, pp. 801--804, 2005."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2003.821786"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.890292"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/4.44992"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687631"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3289600.3290967"},{"key":"e_1_3_2_1_20_1","volume-title":"ICLR","author":"Kipf T.","year":"2017","unstructured":"T. Kipf , \"Semi-supervised classification with graph convolutional networks,\" in Proc . ICLR , 2017 . T. Kipf, \"Semi-supervised classification with graph convolutional networks,\" in Proc. ICLR, 2017."},{"key":"e_1_3_2_1_21_1","first-page":"926","volume-title":"NeurIPS","author":"Socher R.","year":"2013","unstructured":"R. Socher , with neural tensor networks for knowledge base completion,\" in Proc . NeurIPS , pp. 926 -- 934 , 2013 . R. Socher, et al., \"Reasoning with neural tensor networks for knowledge base completion,\" in Proc. NeurIPS, pp. 926--934, 2013."},{"key":"e_1_3_2_1_22_1","first-page":"271","volume-title":"Int. Conf. Pattern Recognition Applications and Methods","author":"Abu-Aisheh Z.","year":"2015","unstructured":"Z. Abu-Aisheh , exact graph edit distance algorithm for solving pattern recognition problems,\" in Proc . Int. Conf. Pattern Recognition Applications and Methods , pp. 271 -- 278 , 2015 . Z. Abu-Aisheh, et al., \"An exact graph edit distance algorithm for solving pattern recognition problems,\" in Proc. Int. Conf. Pattern Recognition Applications and Methods, pp. 271--278, 2015."}],"event":{"name":"ICCAD '20: IEEE\/ACM International Conference on Computer-Aided Design","location":"Virtual Event USA","acronym":"ICCAD '20","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE CS"]},"container-title":["Proceedings of the 39th International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415685","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3400302.3415685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:52Z","timestamp":1750197772000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3400302.3415685"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,11,2]]},"references-count":21,"alternative-id":["10.1145\/3400302.3415685","10.1145\/3400302"],"URL":"https:\/\/doi.org\/10.1145\/3400302.3415685","relation":{},"subject":[],"published":{"date-parts":[[2020,11,2]]},"assertion":[{"value":"2020-12-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}