{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:38:48Z","timestamp":1773376728413,"version":"3.50.1"},"reference-count":12,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003977","name":"Israel Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003977","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206624","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1408-1413","source":"Crossref","is-referenced-by-count":1,"title":["On the Implementation of Boolean Functions on Content-Addressable Memories"],"prefix":"10.1109","author":[{"given":"Ron M.","family":"Roth","sequence":"first","affiliation":[{"name":"Technion,Computer Science Department,Haifa,Israel,3200003"}]}],"member":"263","reference":[{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0021-9800(66)80035-2"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-020-15254-4"},{"key":"ref12","first-page":"215","article-title":"A versatile content addressable memory architecture","author":"yang","year":"2007","journal-title":"Proc 20th Anniversary IEEE Int’l SOC Conf"},{"key":"ref9","author":"macwilliams","year":"1977","journal-title":"The Theory of Error-Correcting Codes"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-69068-9_21"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2009.5062045"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CICC.2003.1249424"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1038\/s41467-021-25873-0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3060578"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(96)00084-1"},{"key":"ref2","author":"anthony","year":"1992","journal-title":"Computational Learning Theory"},{"key":"ref1","author":"anderson","year":"1987","journal-title":"Combinatorics of Finite Sets"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206624.pdf?arnumber=10206624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:27:57Z","timestamp":1773347277000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206624\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206624","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}