{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:19Z","timestamp":1773377659946,"version":"3.50.1"},"reference-count":13,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834477","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"246-251","source":"Crossref","is-referenced-by-count":6,"title":["Speeding Up AIFV-m Dynamic Programs by m\u20131 Orders of Magnitude"],"prefix":"10.1109","author":[{"given":"Mordecai J.","family":"Golin","sequence":"first","affiliation":[{"name":"CSE, HKUST,Hong Kong"}]},{"given":"Albert John L.","family":"Patupat","sequence":"additional","affiliation":[{"name":"CSE, HKUST,Hong Kong"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/18.705558"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/18.850708"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2021.02.040"},{"key":"ref13","author":"cormen","year":"2002","journal-title":"Introduction to Algorithms"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2492961"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174219"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849856"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437861"},{"key":"ref8","first-page":"641","article-title":"A dynamic programming algorithm to construct optimal code trees of aifv codes","author":"iwata","year":"2016","journal-title":"2016 International Symposium on Information Theory and Its Applications (ISITA)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2019.00031"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2694017"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JRPROC.1952.273898"},{"key":"ref9","first-page":"519","article-title":"An iterative algorithm to construct optimal binary aifv-m codes","author":"iwata","year":"2017","journal-title":"2017 IEEE Information Theory Workshop (ITW)"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834477.pdf?arnumber=9834477","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:46Z","timestamp":1773347686000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834477\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":13,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834477","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}