{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:31:59Z","timestamp":1750221119066,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,2,20]],"date-time":"2019-02-20T00:00:00Z","timestamp":1550620800000},"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":[[2019,2,20]]},"DOI":"10.1145\/3289602.3294000","type":"proceedings-article","created":{"date-parts":[[2019,2,22]],"date-time":"2019-02-22T22:12:13Z","timestamp":1550873533000},"page":"307-308","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["HOTMeTaL"],"prefix":"10.1145","author":[{"given":"Michael","family":"Kapralos","sequence":"first","affiliation":[{"name":"University of Connecticut, Storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Chandy","sequence":"additional","affiliation":[{"name":"University of Connecticut, storrs, CT, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,2,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS).","author":"Amar\u00fa Luca","year":"2015","unstructured":"Luca Amar\u00fa , Pierre-Emmanuel Gaillardon , and Giovanni De Micheli . 2015 . The EPFL combinational benchmark suite . In Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS). Luca Amar\u00fa, Pierre-Emmanuel Gaillardon, and Giovanni De Micheli. 2015. The EPFL combinational benchmark suite. In Proceedings of the 24th International Workshop on Logic & Synthesis (IWLS)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.23919\/DATE.2018.8342108"},{"key":"e_1_3_2_1_3_1","volume-title":"Hardware Model Checking Competition2017. FormalMethodsinComputer-AidedDesignFMCAD2017","author":"Biere Armin","year":"2017","unstructured":"Armin Biere , Tom van Dijk , and Keijo Heljanko . 2017. Hardware Model Checking Competition2017. FormalMethodsinComputer-AidedDesignFMCAD2017 ( 2017 ), 9. Armin Biere, Tom van Dijk, and Keijo Heljanko. 2017. Hardware Model Checking Competition2017. FormalMethodsinComputer-AidedDesignFMCAD2017 (2017), 9."},{"key":"e_1_3_2_1_4_1","volume-title":"Variable Precision Floating Point Division and Square Root. 8th Annual High Performance Embedded Computing Workshop","author":"Conti Albert","year":"2004","unstructured":"Albert Conti , Xiaojun Wang , and Miriam Leeser . 2004 . Variable Precision Floating Point Division and Square Root. 8th Annual High Performance Embedded Computing Workshop . Lexington, MA. Albert Conti, Xiaojun Wang, and Miriam Leeser. 2004. Variable Precision Floating Point Division and Square Root. 8th Annual High Performance Embedded Computing Workshop. Lexington, MA."},{"volume-title":"Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on. IEEE,96--105","author":"Cornea-Hasegan M.A.","unstructured":"M.A. Cornea-Hasegan , R.A. Golliver , and P. Markstein . 1999. Correctness proofs outline for Newton-Raphson based floating-point divide and square root algo-rithms . In Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on. IEEE,96--105 . M.A. Cornea-Hasegan, R.A. Golliver, and P. Markstein. 1999. Correctness proofs outline for Newton-Raphson based floating-point divide and square root algo-rithms. In Computer Arithmetic, 1999. Proceedings. 14th IEEE Symposium on. IEEE,96--105.","key":"e_1_3_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/12.863031"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2851507"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/TCSI.2006.875179"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/EURMIC.1999.794480"},{"key":"e_1_3_2_1_10_1","volume-title":"et al","author":"Kornerup P.","year":"2003","unstructured":"P. Kornerup , J.M. Muller , et al . 2003 . Choosing starting values for Newton-Raphson computation of reciprocals, square-roots and square-root reciprocals. (2003). P. Kornerup, J.M. Muller, et al . 2003. Choosing starting values for Newton-Raphson computation of reciprocals, square-roots and square-root reciprocals. (2003)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1109\/FPL.2011.69"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/3020078.3021735"},{"key":"e_1_3_2_1_14_1","volume-title":"Minimization of Boolean functions. Bell system technical Journal 35, 6","author":"McCluskey Edward J","year":"1956","unstructured":"Edward J McCluskey Jr . 1956. Minimization of Boolean functions. Bell system technical Journal 35, 6 ( 1956 ), 1417--1444. Edward J McCluskey Jr. 1956. Minimization of Boolean functions. Bell system technical Journal 35, 6 (1956), 1417--1444."},{"volume-title":"39th Asilomar Con-ference on Signals, Systems and Computers","author":"Muller Jean-Michel","unstructured":"Jean-Michel Muller , Arnaud Tisserand , and Milos Ercegovac . 2005. Simple Seed Architectures for Reciprocal and Square-Root Reciprocal . In 39th Asilomar Con-ference on Signals, Systems and Computers . IEEE , 1167--1171. Jean-Michel Muller, Arnaud Tisserand, and Milos Ercegovac. 2005. Simple Seed Architectures for Reciprocal and Square-Root Reciprocal. In 39th Asilomar Con-ference on Signals, Systems and Computers. IEEE, 1167--1171.","key":"e_1_3_2_1_15_1"},{"key":"e_1_3_2_1_16_1","volume-title":"The problem of simplifying truth functions. The American mathematical monthly 59, 8","author":"Quine Willard V","year":"1952","unstructured":"Willard V Quine . 1952. The problem of simplifying truth functions. The American mathematical monthly 59, 8 ( 1952 ), 521--531. Willard V Quine. 1952. The problem of simplifying truth functions. The American mathematical monthly 59, 8 (1952), 521--531."},{"volume-title":"Exact minimization of multiple-valued functions for PLA optimization","author":"Rudell Richard","unstructured":"Richard Rudell and Alberto Sangiovanni-Vincentelli . 2003. Exact minimization of multiple-valued functions for PLA optimization . In The Best of ICCAD. Springer , 205--216. Richard Rudell and Alberto Sangiovanni-Vincentelli. 2003. Exact minimization of multiple-valued functions for PLA optimization. In The Best of ICCAD. Springer, 205--216.","key":"e_1_3_2_1_17_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/TCAD.1987.1270318"},{"key":"e_1_3_2_1_19_1","volume-title":"Design Automation Conference (ASP-DAC)","author":"Schmitt Bruno","year":"2017","unstructured":"Bruno de O Schmitt , Alan Mishchenko , Victor N Kravets , Robert K Brayton ,and Andre I Reis . 2017 . Fast-extract with cube hashing . In Design Automation Conference (ASP-DAC) , 2017 22nd Asia and South Pacific. IEEE, 145--150. Bruno de O Schmitt, Alan Mishchenko, Victor N Kravets, Robert K Brayton,and Andre I Reis. 2017. Fast-extract with cube hashing. In Design Automation Conference (ASP-DAC), 2017 22nd Asia and South Pacific. IEEE, 145--150."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1145\/1950413.1950425"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/1839480.1839486"}],"event":{"sponsor":["SIGDA ACM Special Interest Group on Design Automation"],"acronym":"FPGA '19","name":"FPGA '19: The 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays","location":"Seaside CA USA"},"container-title":["Proceedings of the 2019 ACM\/SIGDA International Symposium on Field-Programmable Gate Arrays"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3294000","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:02:07Z","timestamp":1750208527000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3289602.3294000"}},"subtitle":["Hardware Optimization Tool for Memory Table and Logic Conversion"],"short-title":[],"issued":{"date-parts":[[2019,2,20]]},"references-count":20,"alternative-id":["10.1145\/3289602.3294000","10.1145\/3289602"],"URL":"https:\/\/doi.org\/10.1145\/3289602.3294000","relation":{},"subject":[],"published":{"date-parts":[[2019,2,20]]},"assertion":[{"value":"2019-02-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}