{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:05:31Z","timestamp":1767035131473,"version":"3.41.0"},"reference-count":33,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2005,3,1]],"date-time":"2005-03-01T00:00:00Z","timestamp":1109635200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["J. Emerg. Technol. Comput. Syst."],"published-print":{"date-parts":[[2005,3]]},"abstract":"<jats:p>Quantum-dot Cellular Automata (QCA) is a novel computing mechanism that can represent binary information based on spatial distribution of an electron charge configuration in chemical molecules. In this article, we present the first partitioning and placement algorithm for automatic QCA layout. We identify several objectives and constraints that will enhance the buildability of QCA circuits. The results are intended to: (1) define what is computationally interesting and could actually be built within a set of predefined constraints, (2) project what designs will be possible as additional constructs become realizable, and (3) provide a vehicle that we can use to compare QCA systems to silicon-based systems.<\/jats:p>","DOI":"10.1145\/1063803.1063806","type":"journal-article","created":{"date-parts":[[2005,8,1]],"date-time":"2005-08-01T15:13:17Z","timestamp":1122909197000},"page":"50-72","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Partitioning and placement for buildable QCA circuits"],"prefix":"10.1145","volume":"1","author":[{"given":"Sung Kyu","family":"Lim","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramprasad","family":"Ravichandran","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mike","family":"Niemier","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, Atlanta, GA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1116\/1.590410"},{"key":"e_1_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Amlani I. Orlov A. Toth G. Bernstein G. Lent C. and Snider G. 1999. . . . Science. 289--291. Amlani I. Orlov A. Toth G. Bernstein G. Lent C. and Snider G. 1999. Digital logic gate using quantum-dot cellular automata. Science. 289--291.","DOI":"10.1126\/science.284.5412.289"},{"volume-title":"Proceedings of the ACM Design Automation Conference. 10","author":"Antonelli D.","key":"e_1_2_1_3_1"},{"volume-title":"Proceedings of the ACM Design Automation Conference. 10","author":"Bernstein G.","key":"e_1_2_1_4_1"},{"volume-title":"Proceedings of the Asia and South Pacific Design Automation Conference. 441--446","author":"Cong J.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1985.1270101"},{"key":"e_1_2_1_7_1","article-title":"Evaluation and optimization of replication algorithms for logic bipartitioning","volume":"10","author":"Enos M.","year":"1999","journal-title":"IEEE Trans. Comput.-Aid. Des. Integr. Circuits Syst. 1237--1248."},{"key":"e_1_2_1_8_1","unstructured":"Garey M. R. and Johnson D. S. 1979. . . . A Freeman San Francisco 209--210. Garey M. R. and Johnson D. S. 1979. Computers and Intractability: A Guide To the Theory of NP-Completeness. Freeman San Francisco 209--210."},{"volume-title":"Proceedings of the Great Lakes Symposum on VLSI. 60--63","author":"Gergel N.","key":"e_1_2_1_9_1"},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Hamilton S. 1999. Taking moore's law into the next century. IEEE Comput. 43--48. 10.1109\/2.738303 Hamilton S. 1999. Taking moore's law into the next century. IEEE Comput. 43--48. 10.1109\/2.738303","DOI":"10.1109\/2.738303"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Hennessy K. and Lent C. 2001. . . . J. Vacuum Science Tech. 1752--1755. Hennessy K. and Lent C. 2001. Clocking of molecular quantum-dot cellular automata. J. Vacuum Science Tech. 1752--1755.","DOI":"10.1116\/1.1394729"},{"volume-title":"Proceedings of the IEEE. 490--504","author":"Ho R.","key":"e_1_2_1_12_1"},{"volume-title":"Proceedings of the Great Lakes Symposum on VLSI. 10","author":"Huang J.","key":"e_1_2_1_13_1"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.67789"},{"key":"e_1_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Kummamuru R. Timler J. Toth G. Lent C. Ramasubramaniam R. Orlov A. and Bernstein G. 2002. . . . Applied Physics Letters. 1332--1334. Kummamuru R. Timler J. Toth G. Lent C. Ramasubramaniam R. Orlov A. and Bernstein G. 2002. Power gain in a quantum-dot cellular automata latch. Applied Physics Letters. 1332--1334.","DOI":"10.1063\/1.1499511"},{"key":"e_1_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Leni C. S. 2002. Molecular electronics: Bypassing the transistor paradigm. Science 1597--1599. Leni C. S. 2002. Molecular electronics: Bypassing the transistor paradigm. Science 1597--1599.","DOI":"10.1126\/science.288.5471.1597"},{"key":"e_1_2_1_17_1","doi-asserted-by":"crossref","DOI":"10.1111\/j.1749-6632.2002.tb03037.x","article-title":"Quantum-dot cellular automata at a molecular scale","author":"Lieberman M.","year":"2002","journal-title":"Annals of the New York Academy of Science. 225--239."},{"key":"e_1_2_1_18_1","unstructured":"Mead C. and Conway L. 1980. . . . . . . . . . . . . . . . Addison-Wesley Publishing Co. Mead C. and Conway L. 1980. Introduction to VLSI Systems. Addison-Wesley Publishing Co."},{"volume-title":"Proceedings of the IEEE International Conference on Computer-Aided Design. 472--479","author":"Murata H.","key":"e_1_2_1_19_1"},{"volume-title":"Tech. Rep. GIT-CERCS-03-20","year":"2003","author":"Nguyen J.","key":"e_1_2_1_20_1"},{"key":"e_1_2_1_21_1","unstructured":"Niemier M. 2003. The effects of a new technology on the design organization and architectures of computing systems. Ph.D. Dissertation Univ. of Notre Dame. Niemier M. 2003. The effects of a new technology on the design organization and architectures of computing systems. Ph.D. Dissertation Univ. of Notre Dame."},{"volume-title":"Proceedings of the Great Lakes Symposum on VLSI.","author":"Niemier M.","key":"e_1_2_1_22_1"},{"volume-title":"IEEE Symposium on VLSI. 3--10","author":"Niemier M.","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Packan P. 1999. Pushing the limits. Science 2079--2081. Packan P. 1999. Pushing the limits. Science 2079--2081.","DOI":"10.1126\/science.285.5436.2079"},{"key":"e_1_2_1_25_1","unstructured":"Rabaey J. M. 1996. Digital Integrated Circuits: A Design Perspective. Prentice Hall Electronics. Rabaey J. M. 1996. Digital Integrated Circuits: A Design Perspective. Prentice Hall Electronics."},{"volume-title":"Proceedings of the Great Lakes Symposum on VLSI. 634--639","author":"Ravichandran R.","key":"e_1_2_1_26_1"},{"key":"e_1_2_1_27_1","unstructured":"Rutten P. 2001. Is moore's law infinite? The economics of Moore's law. Kellog Tech Venture. 1--28. Rutten P. 2001. Is moore's law infinite? The economics of Moore's law. Kellog Tech Venture. 1--28."},{"key":"e_1_2_1_28_1","article-title":"Quantum-dot cellular automata: Line and majority gate logic. Jpn","author":"Snider G.","year":"1999","journal-title":"J. Appl. Phys., 7227--7229."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1981.4308636"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.365125"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.356375"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.205004"},{"key":"e_1_2_1_33_1","doi-asserted-by":"crossref","unstructured":"Walus K. Dysart T. Jullien G. and Budiman R. 2004. . . . A rapid design and simulation tool for quantum-dot cellular automata. rapid design and simulation tool for quantum-dot cellular automata. rapid design and simulation tool for quantum-dot cellular automata. rapid design and simulation tool for quantum-dot cellular automata. Nanotech. 10.1109\/TNANO.2003.820815 Walus K. Dysart T. Jullien G. and Budiman R. 2004. QCADesigner: A rapid design and simulation tool for quantum-dot cellular automata. IEEE Trans. Nanotech. 10.1109\/TNANO.2003.820815","DOI":"10.1109\/TNANO.2003.820815"}],"container-title":["ACM Journal on Emerging Technologies in Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1063803.1063806","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1063803.1063806","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:19:11Z","timestamp":1750263551000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1063803.1063806"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,3]]}},"alternative-id":["10.1145\/1063803.1063806"],"URL":"https:\/\/doi.org\/10.1145\/1063803.1063806","relation":{},"ISSN":["1550-4832","1550-4840"],"issn-type":[{"type":"print","value":"1550-4832"},{"type":"electronic","value":"1550-4840"}],"subject":[],"published":{"date-parts":[[2005,3]]},"assertion":[{"value":"2005-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}