{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T17:00:55Z","timestamp":1774630855105,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,2,12]],"date-time":"2023-02-12T00:00:00Z","timestamp":1676160000000},"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":[[2023,2,12]]},"DOI":"10.1145\/3543622.3573045","type":"proceedings-article","created":{"date-parts":[[2023,2,10]],"date-time":"2023-02-10T23:15:13Z","timestamp":1676070913000},"page":"141-147","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["FPGA Mux Usage and Routability Estimates without Explicit Routing"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7038-6629","authenticated-orcid":false,"given":"Jonathan W.","family":"Greene","sequence":"first","affiliation":[{"name":"University of California at Berkeley & Cambios Computing LLC, Berkeley, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,2,12]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1976.10385"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1979.1675333"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850663"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01219071"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPT.2007.4439225"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499625.2499627"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1046192.1046199"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.252.0152"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538--7305.1962.tb00482.x"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.126.949"},{"key":"e_1_3_2_1_11_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1979","unstructured":"Michael R. Garey and David S. Johnson. 1979. Computers and Intractability: A Guide to the Theory of NP-hardness."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1634.2377"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/313559.313868"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28401"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328911.1328924"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1214\/aop"},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Kodialam Muralidharan","unstructured":"Muralidharan Kodialam and James B. Orlin. 1991. Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and Its Relation to Integer Programming. In Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms (San Francisco, California, USA) (SODA '91). Society for Industrial and Applied Mathematics, USA, 131--135."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2010.2061530"},{"key":"e_1_3_2_1_19_1","volume-title":"https:\/\/www.microchip.com\/en-us\/products\/fpgas-and-plds\/fpgas\/polarfire-fpgas Retrieved","author":"As PolarFire","year":"2022","unstructured":"Microchip. 2022. PolarFire FPGAs. https:\/\/www.microchip.com\/en-us\/products\/fpgas-and-plds\/fpgas\/polarfire-fpgas Retrieved December 20, 2022 from"},{"key":"e_1_3_2_1_20_1","volume-title":"Approximation Algorithms for NP-Hard Problems","author":"Motwani Rajeev","unstructured":"Rajeev Motwani, Joseph Naor, and Prabhakar Raghavan. 1997. Randomized Approximation Algorithms in Combinatorial Optimization. In Approximation Algorithms for NP-Hard Problems, Dorit Hochbaum (Ed.). PWS Publishing Co., Boston."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3388617"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3195800"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/CICC.2005.1568637"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/NSREC.2018.8584300"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICFPT47387.2019.00039"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2007.17"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the IEEE 2022 International Conference on Field Programmable Logic and Applications. IEEE.","author":"Zheng S.","unstructured":"S. Zheng, J. Qian, H. Zhou, and L. Wang. 2022. GRAEBO: FPGA General Routing Architecture Exploration via Bayesian Optimization. In Proceedings of the IEEE 2022 International Conference on Field Programmable Logic and Applications. IEEE."}],"event":{"name":"FPGA '23: The 2023 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays","location":"Monterey CA USA","acronym":"FPGA '23","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2023 ACM\/SIGDA International Symposium on Field Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543622.3573045","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3543622.3573045","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:47Z","timestamp":1750186847000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3543622.3573045"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,2,12]]},"references-count":27,"alternative-id":["10.1145\/3543622.3573045","10.1145\/3543622"],"URL":"https:\/\/doi.org\/10.1145\/3543622.3573045","relation":{},"subject":[],"published":{"date-parts":[[2023,2,12]]},"assertion":[{"value":"2023-02-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}