{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T16:19:02Z","timestamp":1781972342361,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,3,25]],"date-time":"2018-03-25T00:00:00Z","timestamp":1521936000000},"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":[[2018,3,25]]},"DOI":"10.1145\/3177540.3178238","type":"proceedings-article","created":{"date-parts":[[2018,3,16]],"date-time":"2018-03-16T12:53:36Z","timestamp":1521204816000},"page":"2-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Wot the L"],"prefix":"10.1145","author":[{"given":"Andrew B.","family":"Kahng","sequence":"first","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Moyes","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sriram","family":"Venkatesh","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lutong","family":"Wang","sequence":"additional","affiliation":[{"name":"University of California, San Diego, San Diego, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2018,3,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.391737"},{"key":"e_1_3_2_1_2_1","volume-title":"18.05 Introduction to Probability and Statistics","author":"Bloom J.","year":"2014","unstructured":"J. Bloom and J. Orloff , 18.05 Introduction to Probability and Statistics , Cambridge , Massachusetts Institute of Technology : MIT OpenCourseWare, 2014 . https:\/\/ocw.mit.edu J. Bloom and J. Orloff, 18.05 Introduction to Probability and Statistics, Cambridge, Massachusetts Institute of Technology: MIT OpenCourseWare, 2014. https:\/\/ocw.mit.edu"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.784119"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/337292.337549"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2947357.2947363"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215022"},{"key":"e_1_3_2_1_7_1","first-page":"690","volume-title":"Proc. ICCAD","author":"Cheng C. L.","year":"1994","unstructured":"C. L. Cheng , \"RISA : Accurate and Efficient Placement Routability Modeling \", Proc. ICCAD , 1994 , pp. 690 -- 695 . C. L. Cheng, \"RISA: Accurate and Efficient Placement Routability Modeling\", Proc. ICCAD, 1994, pp. 690--695."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907068"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01386390"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.1985.1270101"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.46785"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2015.2391263"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2429384.2429441"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(84)90124-0"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160950"},{"key":"e_1_3_2_1_16_1","volume-title":"Massachusetts Institute of Technology: MITOpenCourseWare","author":"Panchenko D.","year":"2004","unstructured":"D. Panchenko , 18. 650 Statistics for Applications,Cambridge , Massachusetts Institute of Technology: MITOpenCourseWare , 2004 . https:\/\/ocw.mit.edu D. Panchenko, 18.650 Statistics for Applications,Cambridge, Massachusetts Institute of Technology: MITOpenCourseWare, 2004. https:\/\/ocw.mit.edu"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228500"},{"key":"e_1_3_2_1_18_1","unstructured":"ARM Cortex A53 Processor. https:\/\/developer.arm.com\/products\/processors\/cortex-a\/cortex-a53  ARM Cortex A53 Processor. https:\/\/developer.arm.com\/products\/processors\/cortex-a\/cortex-a53"},{"key":"e_1_3_2_1_19_1","unstructured":"Cadence Innovus User Guide.  Cadence Innovus User Guide."},{"key":"e_1_3_2_1_20_1","unstructured":"OpenCores: Open Source IP-Cores. http:\/\/www.opencores.org  OpenCores: Open Source IP-Cores. http:\/\/www.opencores.org"},{"key":"e_1_3_2_1_21_1","unstructured":"RMST-Pack: Rectilinear Minimum Spanning Tree Algorithms {Sourcecode}. http:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/RSMT\/RMST  RMST-Pack: Rectilinear Minimum Spanning Tree Algorithms {Sourcecode}. http:\/\/vlsicad.ucsd.edu\/GSRC\/bookshelf\/Slots\/RSMT\/RMST"},{"key":"e_1_3_2_1_22_1","unstructured":"Synopsys IC Compiler User Guide.  Synopsys IC Compiler User Guide."}],"event":{"name":"ISPD '18: International Symposium on Physical Design","location":"Monterey California USA","acronym":"ISPD '18","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2018 International Symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3178238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3177540.3178238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:50Z","timestamp":1750273550000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3177540.3178238"}},"subtitle":["Analysis of Real versus Random Placed Nets, and Implications for Steiner Tree Heuristics"],"short-title":[],"issued":{"date-parts":[[2018,3,25]]},"references-count":22,"alternative-id":["10.1145\/3177540.3178238","10.1145\/3177540"],"URL":"https:\/\/doi.org\/10.1145\/3177540.3178238","relation":{},"subject":[],"published":{"date-parts":[[2018,3,25]]},"assertion":[{"value":"2018-03-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}