{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,6]],"date-time":"2026-04-06T05:51:15Z","timestamp":1775454675729,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,2,21]],"date-time":"2016-02-21T00:00:00Z","timestamp":1456012800000},"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":[[2016,2,21]]},"DOI":"10.1145\/2847263.2847342","type":"proceedings-article","created":{"date-parts":[[2016,2,4]],"date-time":"2016-02-04T16:26:02Z","timestamp":1454603162000},"page":"74-79","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Boolean Satisfiability-Based Routing and Its Application to Xilinx UltraScale Clock Network"],"prefix":"10.1145","author":[{"given":"Henri","family":"Fraisse","sequence":"first","affiliation":[{"name":"Xilinx Inc., San Jose, CA, USA"}]},{"given":"Abhishek","family":"Joshi","sequence":"additional","affiliation":[{"name":"Xilinx Inc., San Jose, CA, USA"}]},{"given":"Dinesh","family":"Gaitonde","sequence":"additional","affiliation":[{"name":"Xilinx Inc., San Jose, CA, USA"}]},{"given":"Alireza","family":"Kaviani","sequence":"additional","affiliation":[{"name":"Xilinx Inc., San Jose, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/800157.805047"},{"key":"e_1_3_2_1_2_1","first-page":"290","volume-title":"Proceedings of the 11th International Joint Conference on Artificial Intelligence -","volume":"1","author":"De Kleer J.","year":"1989","unstructured":"J. De Kleer . A comparison of atms and csp techniques . In Proceedings of the 11th International Joint Conference on Artificial Intelligence - Volume 1 , IJCAI'89, pages 290 -- 296 , San Francisco, CA, USA , 1989 . Morgan Kaufmann Publishers Inc. J. De Kleer. A comparison of atms and csp techniques. In Proceedings of the 11th International Joint Conference on Artificial Intelligence - Volume 1, IJCAI'89, pages 290--296, San Francisco, CA, USA, 1989. Morgan Kaufmann Publishers Inc."},{"key":"e_1_3_2_1_3_1","series-title":"Lecture Notes in Computer Science","first-page":"502","volume-title":"Theory and Applications of Satisfiability Testing","author":"E\u00efn N.","year":"2004","unstructured":"N. E\u00efn and N. S\u00efrensson . An extensible sat-solver . In E. Giunchiglia and A. Tacchella, editors, Theory and Applications of Satisfiability Testing , volume 2919 of Lecture Notes in Computer Science , pages 502 -- 518 . Springer Berlin Heidelberg , 2004 . N. E\u00efn and N. S\u00efrensson. An extensible sat-solver. In E. Giunchiglia and A. Tacchella, editors, Theory and Applications of Satisfiability Testing, volume 2919 of Lecture Notes in Computer Science, pages 502--518. Springer Berlin Heidelberg, 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"Using sat for combinational equivalence checking","author":"Goldberg E.","year":"2001","unstructured":"E. Goldberg , M. R. Prasad , and R. K. Brayton . Using sat for combinational equivalence checking , 2001 . E. Goldberg, M. R. Prasad, and R. K. Brayton. Using sat for combinational equivalence checking, 2001."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2012.2202326"},{"key":"e_1_3_2_1_6_1","first-page":"253","volume-title":"IN PROCEEDINGS OF THE WORLD COMPUTER CONGRESS OF THE IFIP","author":"Iwama K.","year":"1994","unstructured":"K. Iwama and S. Miyazaki . Sat-variable complexity of hard combinatorial problems . In IN PROCEEDINGS OF THE WORLD COMPUTER CONGRESS OF THE IFIP , pages 253 -- 258 . ELSEVIER SCIENCE B.V, 1994 . K. Iwama and S. Miyazaki. Sat-variable complexity of hard combinatorial problems. In IN PROCEEDINGS OF THE WORLD COMPUTER CONGRESS OF THE IFIP, pages 253--258. ELSEVIER SCIENCE B.V, 1994."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.769433"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/201310.201328"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508128.1508152"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/378239.379017"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2004.1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"G.-J.\n      Nam K.\n      Sakallah and \n      R.\n      Rutenbar\n  . \n  Hybrid routing for fpgas by integrating boolean satisfiability with geometric search\n  . In M. Glesner P. Zipf and M. Renovell editors Field-Programmable Logic and Applications: \n  Reconfigurable Computing\n   Is Going Mainstream volume \n  2438\n   of \n  Lecture Notes in Computer Science pages \n  360\n  --\n  369\n  . \n  Springer Berlin Heidelberg 2002\n  .   G.-J. Nam K. Sakallah and R. Rutenbar. Hybrid routing for fpgas by integrating boolean satisfiability with geometric search. In M. Glesner P. Zipf and M. Renovell editors Field-Programmable Logic and Applications: Reconfigurable Computing Is Going Mainstream volume 2438 of Lecture Notes in Computer Science pages 360--369. Springer Berlin Heidelberg 2002.","DOI":"10.1007\/3-540-46117-5_38"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2002.1004311"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/978-3-540-72788-0_14","volume-title":"Theory and Applications of Satisfiability Testing -- SAT","author":"Prestwich S.","year":"2007","unstructured":"S. Prestwich . Variable dependency in local search: Prevention is better than cure . In J. Marques-Silva and K. Sakallah, editors, Theory and Applications of Satisfiability Testing -- SAT 2007 , volume 4501 of Lecture Notes in Computer Science , pages 107 -- 120 . Springer Berlin Heidelberg , 2007. S. Prestwich. Variable dependency in local search: Prevention is better than cure. In J. Marques-Silva and K. Sakallah, editors, Theory and Applications of Satisfiability Testing -- SAT 2007, volume 4501 of Lecture Notes in Computer Science, pages 107--120. Springer Berlin Heidelberg, 2007."},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP","author":"Sinz C.","year":"2005","unstructured":"C. Sinz . Towards an optimal cnf encoding of boolean cardinality constraints . In P. van Beek, editor, Principles and Practice of Constraint Programming - CP 2005 , volume 3709 of Lecture Notes in Computer Science , pages 827 -- 831 . Springer Berlin Heidelberg , 2005. C. Sinz. Towards an optimal cnf encoding of boolean cardinality constraints. In P. van Beek, editor, Principles and Practice of Constraint Programming - CP 2005, volume 3709 of Lecture Notes in Computer Science, pages 827--831. Springer Berlin Heidelberg, 2005."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2003.812322"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-81955-1_28"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403682"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.678873"},{"key":"e_1_3_2_1_20_1","unstructured":"Xilinx. UltraScale Architecture and Product Overview.  Xilinx. UltraScale Architecture and Product Overview."},{"key":"e_1_3_2_1_21_1","unstructured":"Xilinx. Vivado Design Suite User Guide.  Xilinx. Vivado Design Suite User Guide."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/603095.603153"}],"event":{"name":"FPGA'16: The 2016 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Monterey California USA","acronym":"FPGA'16","sponsor":["SIGDA ACM Special Interest Group on Design Automation"]},"container-title":["Proceedings of the 2016 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847263.2847342","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2847263.2847342","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:43:26Z","timestamp":1750225406000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2847263.2847342"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,2,21]]},"references-count":22,"alternative-id":["10.1145\/2847263.2847342","10.1145\/2847263"],"URL":"https:\/\/doi.org\/10.1145\/2847263.2847342","relation":{},"subject":[],"published":{"date-parts":[[2016,2,21]]},"assertion":[{"value":"2016-02-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}