{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T16:13:35Z","timestamp":1774800815958,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"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":[[2010,6,13]]},"DOI":"10.1145\/1837274.1837421","type":"proceedings-article","created":{"date-parts":[[2010,10,28]],"date-time":"2010-10-28T14:47:40Z","timestamp":1288277260000},"page":"597-602","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Eyecharts"],"prefix":"10.1145","author":[{"given":"Puneet","family":"Gupta","sequence":"first","affiliation":[{"name":"University of California, Los Angeles"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew B.","family":"Kahng","sequence":"additional","affiliation":[{"name":"University of California, San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amarnath","family":"Kasibhatla","sequence":"additional","affiliation":[{"name":"University of California, Los Angeles"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Puneet","family":"Sharma","sequence":"additional","affiliation":[{"name":"Freescale Semiconductor"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"468","volume-title":"Proc. ICCD","author":"Li W. N.","year":"1993","unstructured":"W. N. Li , \" Strongly NP- Hard Discrete Gate Sizing Problems,\" Proc. ICCD , pp. 468 -- 471 , 1993 . W. N. Li, \"Strongly NP-Hard Discrete Gate Sizing Problems,\" Proc. ICCD, pp. 468--471, 1993."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.857313"},{"key":"e_1_3_2_1_3_1","first-page":"269","volume-title":"ICCAD","author":"Fishburn J.","year":"1985","unstructured":"J. Fishburn and A. Dunlop , \" TILOS: A Posynomial Programming Approach to Transistor Sizing,\" Proc . ICCAD , pp. 269 -- 273 , 1985 . J. Fishburn and A. Dunlop, \"TILOS: A Posynomial Programming Approach to Transistor Sizing,\" Proc. ICCAD, pp. 269--273, 1985."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/123186.123302"},{"key":"e_1_3_2_1_5_1","first-page":"217","volume-title":"Proc. EURO-DAC","author":"Berkelaar M. R. C. M.","year":"1990","unstructured":"M. R. C. M. Berkelaar and J. A. G. Jess , \" Gate Sizing in MOS Digital Circuits with Linear Programming ,\" Proc. EURO-DAC , pp. 217 -- 221 , 1990 . M. R. C. M. Berkelaar and J. A. G. Jess, \"Gate Sizing in MOS Digital Circuits with Linear Programming,\" Proc. EURO-DAC, pp. 217--221, 1990."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISQED.2009.4810282"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/871506.871545"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/871506.871543"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/774572.774631"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289097"},{"key":"e_1_3_2_1_11_1","first-page":"482","volume-title":"ICCAD","author":"Sapatnekar S. S.","year":"1991","unstructured":"S. S. Sapatnekar , V. B. Rao , and P. M. Vaidya , \" A Convex Optimization Approach to Transistor Sizing for CMOS Circuits,\" Proc . ICCAD , pp. 482 -- 485 , 1991 . S. S. Sapatnekar, V. B. Rao, and P. M. Vaidya, \"A Convex Optimization Approach to Transistor Sizing for CMOS Circuits,\" Proc. ICCAD, pp. 482--485, 1991."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.851993"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065793"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.645073"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/240518.240658"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.994980"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1278480.1278690"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1514932.1514940"},{"key":"e_1_3_2_1_19_1","first-page":"705","volume-title":"ICCAD","author":"Shah S. S.","year":"2005","unstructured":"S. S. Shah , A. Srivastava , V. Zolotov , D. Sharma , D. Sylvester , and D. Blaauw , \" Discrete Vt Assignment and Gate Sizing Using a Self-snapping Continuous Formulation,\" Proc . ICCAD , pp. 705 -- 711 , 2005 . S. S. Shah, A. Srivastava, V. Zolotov, D. Sharma, D. Sylvester, and D. Blaauw, \"Discrete Vt Assignment and Gate Sizing Using a Self-snapping Continuous Formulation,\" Proc. ICCAD, pp. 705--711, 2005."},{"key":"e_1_3_2_1_20_1","first-page":"107","volume-title":"ICCAD","author":"Wu T.-H.","year":"2008","unstructured":"T.-H. Wu and A. Davoodi , \" PaRS: Fast and Near-optimal Grid-based Cell Sizing for Library-based Design,\" Proc . ICCAD , pp. 107 -- 111 , 2008 . T.-H. Wu and A. Davoodi, \"PaRS: Fast and Near-optimal Grid-based Cell Sizing for Library-based Design,\" Proc. ICCAD, pp. 107--111, 2008."},{"key":"e_1_3_2_1_21_1","first-page":"7","volume-title":"IWLS","author":"Ren H.","year":"2008","unstructured":"H. Ren and S. Dutt , \" A Network-Flow Based Cell Sizing Algorithm,\" Proc . IWLS , pp. 7 -- 14 , 2008 . H. Ren and S. Dutt, \"A Network-Flow Based Cell Sizing Algorithm,\" Proc. IWLS, pp. 7--14, 2008."},{"key":"e_1_3_2_1_22_1","volume-title":"IWLS","author":"Markov I. L.","year":"2003","unstructured":"I. L. Markov and J. A. Roy , \" On Sub-optimality and Scalability of Logic Synthesis Tools,\" Proc . IWLS , 2003 . I. L. Markov and J. A. Roy, \"On Sub-optimality and Scalability of Logic Synthesis Tools,\" Proc. IWLS, 2003."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/996070.1009932"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/217474.217532"},{"key":"e_1_3_2_1_25_1","first-page":"148","volume-title":"Proc. GLSVLSI","author":"Lillis J.","year":"1996","unstructured":"J. Lillis , C.-K. Cheng , and T.-T. Y. Lin , \" Simultaneous Routing and Buffer Insertion for High Performance Interconnect ,\" Proc. GLSVLSI , pp. 148 -- 153 , 1996 . J. Lillis, C.-K. Cheng, and T.-T. Y. Lin, \"Simultaneous Routing and Buffer Insertion for High Performance Interconnect,\" Proc. GLSVLSI, pp. 148--153, 1996."},{"key":"e_1_3_2_1_26_1","first-page":"865","volume-title":"Proc. ISCAS","volume":"2","author":"van Ginneken L.","year":"1990","unstructured":"L. van Ginneken , \" Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay ,\" Proc. ISCAS , pp. 865 -- 868 vol. 2 , 1990 . L. van Ginneken, \"Buffer Placement in Distributed RC-tree Networks for Minimal Elmore Delay,\" Proc. ISCAS, pp. 865--868 vol. 2, 1990."},{"key":"e_1_3_2_1_27_1","volume-title":"Dynamic Programming","author":"Bellman R.","year":"1957","unstructured":"R. Bellman , Dynamic Programming . Dover Publications , N.Y , 1957 . R. Bellman, Dynamic Programming. Dover Publications, N.Y, 1957."}],"event":{"name":"DAC '10: The 47th Annual Design Automation Conference 2010","location":"Anaheim California","acronym":"DAC '10","sponsor":["EDAC Electronic Design Automation Consortium","SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA"]},"container-title":["Proceedings of the 47th Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837421","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1837274.1837421","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:35Z","timestamp":1750246775000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1837274.1837421"}},"subtitle":["constructive benchmarking of gate sizing heuristics"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":27,"alternative-id":["10.1145\/1837274.1837421","10.1145\/1837274"],"URL":"https:\/\/doi.org\/10.1145\/1837274.1837421","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}