{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T15:12:16Z","timestamp":1777993936455,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,1]],"date-time":"2014-06-01T00:00:00Z","timestamp":1401580800000},"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":[],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1145\/2593069.2593133","type":"proceedings-article","created":{"date-parts":[[2014,5,27]],"date-time":"2014-05-27T12:57:10Z","timestamp":1401195430000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["ePlace"],"prefix":"10.1145","author":[{"given":"Jingwei","family":"Lu","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of California, San Diego"}]},{"given":"Pengwen","family":"Chen","sequence":"additional","affiliation":[{"name":"Department of Applied Mathematics, National Chung Hsing University"}]},{"given":"Chin-Chih","family":"Chang","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, Inc."}]},{"given":"Lu","family":"Sha","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, Inc."}]},{"given":"Dennis J-.H.","family":"Huang","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, Inc."}]},{"given":"Chin-Chi","family":"Teng","sequence":"additional","affiliation":[{"name":"Cadence Design Systems, Inc."}]},{"given":"Chung-Kuan","family":"Cheng","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of California, San Diego"}]}],"member":"320","published-online":{"date-parts":[[2014,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123055"},{"key":"e_1_3_2_1_2_1","first-page":"218","volume-title":"ICCAD","author":"Chen H.-C.","year":"2008","unstructured":"H.-C. Chen , Y.-L. Chunag , Y.-W. Chang , and Y.-C. Chang . Constraint Graph-Based Macro Placement for Modern Mixed-Size Circuit Designs . In ICCAD , pages 218 -- 223 , 2008 . H.-C. Chen, Y.-L. Chunag, Y.-W. Chang, and Y.-C. Chang. Constraint Graph-Based Macro Placement for Modern Mixed-Size Circuit Designs. In ICCAD, pages 218--223, 2008."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2008.927760"},{"issue":"9","key":"e_1_3_2_1_4_1","first-page":"1366","article-title":"Unified Analytical Global Placement for Large-Scale Mixed-Size Circuit Designs","volume":"31","author":"Hsu M.-K.","year":"2012","unstructured":"M.-K. Hsu and Y.-W. Chang . Unified Analytical Global Placement for Large-Scale Mixed-Size Circuit Designs . IEEE TCAD , 31 ( 9 ): 1366 -- 1378 , 2012 . M.-K. Hsu and Y.-W. Chang. Unified Analytical Global Placement for Large-Scale Mixed-Size Circuit Designs. IEEE TCAD, 31(9): 1366--1378, 2012.","journal-title":"IEEE TCAD"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024875"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123057"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228496"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160958"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/2561828.2561900"},{"key":"e_1_3_2_1_10_1","volume-title":"ASICON","author":"Lu J.","year":"2013","unstructured":"J. Lu , P. Chen , C.-C. Chang , L. Sha , D. J.-H. Huang , C.-C. Teng , and C.-K. Cheng . FFTPL : An Analytic Placement Algorithm Using Fast Fourier Transform for Density Equalization . In ASICON , 2013 . J. Lu, P. Chen, C.-C. Chang, L. Sha, D. J.-H. Huang, C.-C. Teng, and C.-K. Cheng. FFTPL: An Analytic Placement Algorithm Using Fast Fourier Transform for Density Equalization. In ASICON, 2013."},{"key":"e_1_3_2_1_11_1","first-page":"231","volume-title":"ISQED","author":"Lu J.","year":"2013","unstructured":"J. Lu and C.-W. Sham . LMgr : A Low-Memory Global Router with Dynamic Topology Update and Bending-Aware Optimum Path Search . In ISQED , pages 231 -- 238 , 2013 . J. Lu and C.-W. Sham. LMgr: A Low-Memory Global Router with Dynamic Topology Update and Bending-Aware Optimum Path Search. In ISQED, pages 231--238, 2013."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1123008.1123042"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1055137.1055182"},{"key":"e_1_3_2_1_14_1","first-page":"6301693","article-title":"Non-Linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer","author":"Naylor W. C.","year":"2001","unstructured":"W. C. Naylor , R. Donelly , and L. Sha . Non-Linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer . In US Patent 6301693 , 2001 . W. C. Naylor, R. Donelly, and L. Sha. Non-Linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer. In US Patent 6301693, 2001.","journal-title":"US Patent"},{"issue":"2","key":"e_1_3_2_1_15_1","first-page":"372","article-title":"A Method of Solving A Convex Programming Problem with Convergence Rate O(1\/k2)","volume":"27","author":"Nesterov Y. E.","year":"1983","unstructured":"Y. E. Nesterov . A Method of Solving A Convex Programming Problem with Convergence Rate O(1\/k2) . Soviet Math , 27 ( 2 ): 372 -- 376 , 1983 . Y. E. Nesterov. A Method of Solving A Convex Programming Problem with Convergence Rate O(1\/k2). Soviet Math, 27(2):372--376, 1983.","journal-title":"Soviet Math"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.855969"},{"key":"e_1_3_2_1_17_1","volume-title":"CMU-CS-TR-94-125","author":"Shewchuk J.","year":"1994","unstructured":"J. Shewchuk . An Introduction to the Conjugate Gradient Method without the Agonizing Pain . In CMU-CS-TR-94-125 , 1994 . J. Shewchuk. An Introduction to the Conjugate Gradient Method without the Agonizing Pain. In CMU-CS-TR-94-125, 1994."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485727"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278599"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2007.357975"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1629911.1630028"}],"event":{"name":"DAC '14: The 51st Annual Design Automation Conference 2014","location":"San Francisco CA USA","acronym":"DAC '14","sponsor":["EDAC Electronic Design Automation Consortium","SIGBED ACM Special Interest Group on Embedded Systems","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA"]},"container-title":["Proceedings of the 51st Annual Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2593069.2593133","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2593069.2593133","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:01:23Z","timestamp":1750230083000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2593069.2593133"}},"subtitle":["Electrostatics Based Placement Using Nesterov's Method"],"short-title":[],"issued":{"date-parts":[[2014,6]]},"references-count":21,"alternative-id":["10.1145\/2593069.2593133","10.1145\/2593069"],"URL":"https:\/\/doi.org\/10.1145\/2593069.2593133","relation":{},"subject":[],"published":{"date-parts":[[2014,6]]},"assertion":[{"value":"2014-06-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}