{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T09:49:42Z","timestamp":1773481782219,"version":"3.50.1"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2014,4,1]],"date-time":"2014-04-01T00:00:00Z","timestamp":1396310400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61071024"],"award-info":[{"award-number":["61071024"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Innovation Fund for Young Researchers of the University of Science and Technology of China"},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["247619"],"award-info":[{"award-number":["247619"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2014,4]]},"abstract":"<jats:p>\n            Due to the super scale, high defect density, and per-chip designing paradigm of emerging nanoelectronics, the runtime of the algorithms for defect-tolerant design is of vital importance from the perspective of practicability. In this article, an efficient and effective heuristic defect-free subcrossbar extraction algorithm is proposed which improves performance by mixing the heuristics from two state-of-the-art algorithms and then is speeded up significantly by considerably reducing the number of major loops. Compared with the current most effective algorithm that improves the solution quality (i.e., size of the defect-free subcrossbar obtained) at the cost of high time complexity\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>3<\/jats:sup>\n            ), the time complexity of the proposed heuristic algorithm is proved to be\n            <jats:italic>O<\/jats:italic>\n            (\n            <jats:italic>n<\/jats:italic>\n            <jats:sup>2<\/jats:sup>\n            ). Using a large set of instances of various scales and defect densities, the simulation results show that the proposed algorithm can offer similar high-quality solutions as the current most effective algorithm while consuming much shorter runtimes (reduced to about 1\/3 to 1\/5) than the current most effective algorithm.\n          <\/jats:p>","DOI":"10.1145\/2517137","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T13:45:52Z","timestamp":1399038352000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A Fast Extraction Algorithm for Defect-Free Subcrossbar in Nanoelectronic Crossbar"],"prefix":"10.1145","volume":"10","author":[{"given":"Bo","family":"Yuan","sequence":"first","affiliation":[{"name":"University of Science and Technology of China"}]},{"given":"Bin","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China"}]}],"member":"320","published-online":{"date-parts":[[2014,5,6]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2007.907875"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.145"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2008.155"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/14\/4\/311"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1559439"},{"key":"e_1_2_1_6_1","volume-title":"Proceedings of the International Conference on Intelligent Systems for Molecular Biology. 93--103","author":"Cheng Y.","unstructured":"Y. Cheng and G. M. Church . 2000. Biclustering of expression data . In Proceedings of the International Conference on Intelligent Systems for Molecular Biology. 93--103 . Y. Cheng and G. M. Church. 2000. Biclustering of expression data. In Proceedings of the International Conference on Intelligent Systems for Molecular Biology. 93--103."},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-009-0105-x"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543438.1543441"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2008.2008392"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1199"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1084748.1084750"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2005.94"},{"key":"e_1_2_1_13_1","unstructured":"M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman San Francisco CA.   M. R. Garey and D. S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman San Francisco CA."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00339-006-3670-5"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00339-006-3736-4"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2010.43"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/379240.379262"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2000502.2000505"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2032356"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNANO.2006.869684"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10836-006-0547-7"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmat2028"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2009.14"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0217045"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"T. Rueckes K. Kim E. Joselevich G. Y. Tseng C.-L. Cheung and C. M. Lieber. 2000. Carbon nanotube-based nonvolatile random access memory for molecular computing. Science 289 5476 94--97.  T. Rueckes K. Kim E. Joselevich G. Y. Tseng C.-L. Cheung and C. M. Lieber. 2000. Carbon nanotube-based nonvolatile random access memory for molecular computing. Science 289 5476 94--97.","DOI":"10.1126\/science.289.5476.94"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00339-004-3154-4"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1088\/0957-4484\/16\/6\/045"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1167943.1167945"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1543438.1543444"},{"key":"e_1_2_1_30_1","volume-title":"Proceedings of the 15th Asia and South Pacific Design Automation Conference. 855--860","author":"Tunc C.","unstructured":"C. Tunc and M. B. Tahoori . 2010. Variation tolerant logic mapping for crossbar array nano architectures . In Proceedings of the 15th Asia and South Pacific Design Automation Conference. 855--860 . C. Tunc and M. B. Tahoori. 2010. Variation tolerant logic mapping for crossbar array nano architectures. In Proceedings of the 15th Asia and South Pacific Design Automation Conference. 855--860."},{"key":"e_1_2_1_31_1","doi-asserted-by":"crossref","unstructured":"H. Yan H. S. Choe S. W. Nam Y. Hu S. Das J. F. Klemic J. C. Ellenbogen and C. M. Lieber. 2011. Programmable nanowire circuits for nanoprocessor. Nature 470 7333 240--244.  H. Yan H. S. Choe S. W. Nam Y. Hu S. Das J. F. Klemic J. C. Ellenbogen and C. M. Lieber. 2011. Programmable nanowire circuits for nanoprocessor. Nature 470 7333 240--244.","DOI":"10.1038\/nature09749"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210022"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2008.01.001"},{"key":"e_1_2_1_34_1","volume-title":"Proceedings of the International Conference on Information Science and Technology. 143--148","author":"Yuan B.","unstructured":"B. Yuan and B. Li . 2011. A low time complexity defect-tolerance algorithm for nanoelectronic crossbar . In Proceedings of the International Conference on Information Science and Technology. 143--148 . B. Yuan and B. Li. 2011. A low time complexity defect-tolerance algorithm for nanoelectronic crossbar. In Proceedings of the International Conference on Information Science and Technology. 143--148."}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517137","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2517137","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:40Z","timestamp":1750231720000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2517137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["10.1145\/2517137"],"URL":"https:\/\/doi.org\/10.1145\/2517137","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"value":"1550-4832","type":"print"},{"value":"1550-4840","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4]]},"assertion":[{"value":"2012-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-08-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2014-05-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}