{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T08:03:38Z","timestamp":1769155418789,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,24]],"date-time":"2013-03-24T00:00:00Z","timestamp":1364083200000},"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":[[2013,3,24]]},"DOI":"10.1145\/2451916.2451954","type":"proceedings-article","created":{"date-parts":[[2013,3,25]],"date-time":"2013-03-25T14:14:26Z","timestamp":1364220866000},"page":"139-146","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":14,"title":["Network flow based datapath bit slicing"],"prefix":"10.1145","author":[{"given":"Hua","family":"Xiang","sequence":"first","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minsik","family":"Cho","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haoxing","family":"Ren","sequence":"additional","affiliation":[{"name":"IBM T.J.Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Ziegler","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruchir","family":"Puri","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Synopsys Module Compiler User Manual.  Synopsys Module Compiler User Manual."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"R. K. Ahuja A. V. Goldberg J. B. Orlin and R. E. Targan Finding minimum-cost flows by double scaling Mathematical programming 53 pp. 243--266 1992.  R. K. Ahuja A. V. Goldberg J. B. Orlin and R. E. Targan Finding minimum-cost flows by double scaling Mathematical programming 53 pp. 243--266 1992.","DOI":"10.1007\/BF01585705"},{"key":"e_1_3_2_1_3_1","volume-title":"Prentice Hall","author":"Ahuja R. K.","year":"1993"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/266388.266548"},{"key":"e_1_3_2_1_5_1","first-page":"Q1","author":"Chan T.","year":"1999","journal-title":"Challenges of CAD Development of Datapath Design, Intel Technology Journal"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228498"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/MDT.2002.1047748"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289050"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/43.511568"},{"key":"e_1_3_2_1_10_1","unstructured":"T. Cormen C. Leiserson R. Rivest and C. Stein Introduction to Algorithms the MIT press.  T. Cormen C. Leiserson R. Rivest and C. Stein Introduction to Algorithms the MIT press."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/369691.369752"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/339492.340051"},{"key":"e_1_3_2_1_13_1","volume-title":"Proc. Intl. Conf. on Computer Design","author":"Kutzschebauch T.","year":"2000"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/602902.603001"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/113938.149419"},{"key":"e_1_3_2_1_16_1","volume":"12","author":"Rao D. S.","year":"1993","journal-title":"On Clustering for Maximal Regularity Extraction, IEEE Trans. on Computer Aided Design"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2007.5"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160916.2160935"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228497"}],"event":{"name":"ISPD'13: International Symposium on Physical Design","location":"Stateline Nevada USA","acronym":"ISPD'13","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2013 ACM International symposium on Physical Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2451916.2451954","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2451916.2451954","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:19Z","timestamp":1750235719000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2451916.2451954"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,24]]},"references-count":19,"alternative-id":["10.1145\/2451916.2451954","10.1145\/2451916"],"URL":"https:\/\/doi.org\/10.1145\/2451916.2451954","relation":{},"subject":[],"published":{"date-parts":[[2013,3,24]]},"assertion":[{"value":"2013-03-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}