{"id":"https://openalex.org/W4386066591","doi":"https://doi.org/10.1109/isit54713.2023.10206624","title":"On the Implementation of Boolean Functions on Content-Addressable Memories","display_name":"On the Implementation of Boolean Functions on Content-Addressable Memories","publication_year":2023,"publication_date":"2023-06-25","ids":{"openalex":"https://openalex.org/W4386066591","doi":"https://doi.org/10.1109/isit54713.2023.10206624"},"language":"en","primary_location":{"id":"doi:10.1109/isit54713.2023.10206624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074098103","display_name":"Ron M. Roth","orcid":"https://orcid.org/0000-0003-4168-9505"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Ron M. Roth","raw_affiliation_strings":["Technion,Computer Science Department,Haifa,Israel,3200003"],"affiliations":[{"raw_affiliation_string":"Technion,Computer Science Department,Haifa,Israel,3200003","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5074098103"],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.1339,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.43535656,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"1408","last_page":"1413"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9939000010490417,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.7983994483947754},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6829856038093567},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6454219818115234},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5812475681304932},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5589609146118164},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5551568865776062},{"id":"https://openalex.org/keywords/ternary-operation","display_name":"Ternary operation","score":0.5493710041046143},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5391722917556763},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5067391991615295},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4997382164001465},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.49396830797195435},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4744316637516022},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.47433987259864807},{"id":"https://openalex.org/keywords/word","display_name":"Word (group theory)","score":0.44373390078544617},{"id":"https://openalex.org/keywords/symbol","display_name":"Symbol (formal)","score":0.42848023772239685},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.412895143032074},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.35871168971061707},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.34780120849609375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27896907925605774},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1189948320388794}],"concepts":[{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.7983994483947754},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6829856038093567},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6454219818115234},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5812475681304932},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5589609146118164},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5551568865776062},{"id":"https://openalex.org/C64452783","wikidata":"https://www.wikidata.org/wiki/Q1524945","display_name":"Ternary operation","level":2,"score":0.5493710041046143},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5391722917556763},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5067391991615295},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4997382164001465},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.49396830797195435},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4744316637516022},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.47433987259864807},{"id":"https://openalex.org/C90805587","wikidata":"https://www.wikidata.org/wiki/Q10944557","display_name":"Word (group theory)","level":2,"score":0.44373390078544617},{"id":"https://openalex.org/C134400042","wikidata":"https://www.wikidata.org/wiki/Q2372244","display_name":"Symbol (formal)","level":2,"score":0.42848023772239685},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.412895143032074},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.35871168971061707},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.34780120849609375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27896907925605774},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1189948320388794},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit54713.2023.10206624","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit54713.2023.10206624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2023 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5899999737739563,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1527096392","https://openalex.org/W1606480398","https://openalex.org/W2000780592","https://openalex.org/W2018198423","https://openalex.org/W2047264287","https://openalex.org/W2073286344","https://openalex.org/W2090534913","https://openalex.org/W2112994361","https://openalex.org/W2157360158","https://openalex.org/W2618376964","https://openalex.org/W2959627720","https://openalex.org/W3098380984","https://openalex.org/W3202965278","https://openalex.org/W6662446322"],"related_works":["https://openalex.org/W257150968","https://openalex.org/W3140601928","https://openalex.org/W1977451125","https://openalex.org/W2168881618","https://openalex.org/W86917440","https://openalex.org/W2057159994","https://openalex.org/W2109998394","https://openalex.org/W1608751818","https://openalex.org/W2133491672","https://openalex.org/W4389483408"],"abstract_inverted_index":{"Let":[0],"[q\u3009":[1,121,131],"denote":[2],"the":[3,43,47,97,126,165,181,203,218],"integer":[4,102],"set":[5,182],"{0,":[6],"1,":[7],"\u2026,":[8],"q":[9,26,188],"\u2212":[10],"1}":[11],"and":[12,46,128,156,199],"let":[13],"${\\mathbb{B}}":[14],"=":[15,109],"\\left\\{":[16],"{0,1}":[17],"\\right\\}$.":[18],"The":[19],"problem":[20],"of":[21,50,139,150,154,167,183,197,202],"implementing":[22],"functions":[23,185],"$\\left[":[24,186],"{\\left.":[25,187],"\\right\\rangle":[27,189],"}":[28,190],"\\right.":[29,191],"\\to":[30,192],"{\\mathbb{B}}$":[31],"on":[32,90],"content-addressable":[33],"memories":[34],"(CAMs)":[35],"is":[36,79,122,132],"considered.":[37],"CAMs":[38,86],"can":[39],"be":[40,212],"classified":[41],"by":[42,81],"input":[44,124,198],"alphabet":[45,49],"state":[48,200],"their":[51],"cells;":[52],"for":[53,84,87,173,180,222],"example,":[54],"in":[55,64,214],"binary":[56],"CAMs,":[57],"those":[58,207],"alphabets":[59,70,201],"are":[60,71,171,209],"both":[61,69],"${\\mathbb{B}}$,":[62],"while":[63],"a":[65,74,133],"ternary":[66],"CAM":[67,137,204],"(TCAM),":[68],"endowed":[72],"with":[73,164],"\"don\u2019t":[75],"care\"":[76],"symbol.This":[77],"work":[78],"motivated":[80],"recent":[82],"proposals":[83],"using":[85],"fast":[88],"inference":[89],"decision":[91],"trees.":[92],"In":[93],"such":[94,104,140],"learning":[95],"models,":[96],"tree":[98],"nodes":[99],"carry":[100],"out":[101],"comparisons,":[103],"as":[105,177,179],"testing":[106],"equality":[107],"(x":[108,114],"t":[110,116,129,146],"?)":[111],"or":[112],"inequality":[113],"\u2264":[115],"?),":[117],"where":[118],"x":[119,158],"\u2208":[120,130],"an":[123],"to":[125,161,211],"node":[127,134],"parameter.":[135],"A":[136],"implementation":[138],"comparisons":[141],"includes":[142],"mapping":[143,157],"(i.e.,":[144],"encoding)":[145],"into":[147,159],"internal":[148],"states":[149],"some":[151],"number":[152],"n":[153,221],"cells":[155],"inputs":[160],"these":[162],"cells,":[163],"goal":[166],"minimizing":[168],"n.Such":[169],"mappings":[170,208],"presented":[172],"various":[174],"comparison":[175],"families,":[176],"well":[178],"all":[184],"{\\mathbb{B}}$,":[193],"under":[194],"several":[195],"scenarios":[196],"cells.":[205],"All":[206],"shown":[210],"optimal":[213],"that":[215],"they":[216],"attain":[217],"smallest":[219],"possible":[220],"any":[223],"given":[224],"q.":[225]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}