{"id":"https://openalex.org/W4411267076","doi":"https://doi.org/10.1145/3729258","title":"Circuit Optimization using Arithmetic Table Lookups","display_name":"Circuit Optimization using Arithmetic Table Lookups","publication_year":2025,"publication_date":"2025-06-10","ids":{"openalex":"https://openalex.org/W4411267076","doi":"https://doi.org/10.1145/3729258"},"language":"en","primary_location":{"id":"doi:10.1145/3729258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729258","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3729258","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005774986","display_name":"Raghav Malik","orcid":"https://orcid.org/0000-0002-6660-6609"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Raghav Malik","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0002-6660-6609","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5118138667","display_name":"Vedant Paranjape","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vedant Paranjape","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0002-3411-4634","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075916086","display_name":"Milind Kulkarni","orcid":"https://orcid.org/0000-0001-6827-345X"},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Milind Kulkarni","raw_affiliation_strings":["Purdue University, West Lafayette, USA"],"raw_orcid":"https://orcid.org/0000-0001-6827-345X","affiliations":[{"raw_affiliation_string":"Purdue University, West Lafayette, USA","institution_ids":["https://openalex.org/I219193219"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I219193219"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.10898502,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":"PLDI","first_page":"301","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991999864578247,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9976999759674072,"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/T10142","display_name":"Formal Methods in Verification","score":0.9976000189781189,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/table","display_name":"Table (database)","score":0.7280632257461548},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.668938934803009},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5519261360168457},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.44928526878356934},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2547154724597931},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.21196889877319336}],"concepts":[{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.7280632257461548},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.668938934803009},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5519261360168457},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44928526878356934},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2547154724597931},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.21196889877319336}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729258","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1145/3729258","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729258","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3729258","source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2227270456","display_name":"SHF: Small: A Composable,  Sound Optimization Framework for Loops and Recursion","funder_award_id":"1908504","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G678784743","display_name":null,"funder_award_id":"CCF-2216987, CCF-1919197, CCF-1908504","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8270137427","display_name":null,"funder_award_id":"CCF-2216987","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8345018822","display_name":"SPX: Write Once, Run on Anything: Verified, Tuned Accelerator Kernels from High Level Specifications","funder_award_id":"1919197","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4411267076.pdf","grobid_xml":"https://content.openalex.org/works/W4411267076.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W2029318567","https://openalex.org/W2766393794","https://openalex.org/W2798404616","https://openalex.org/W2889629344","https://openalex.org/W2890611886","https://openalex.org/W2983934213","https://openalex.org/W3033581399","https://openalex.org/W3099525000","https://openalex.org/W3117137355","https://openalex.org/W3169419954","https://openalex.org/W4246264663","https://openalex.org/W4327930441","https://openalex.org/W4399851001","https://openalex.org/W6947789407","https://openalex.org/W6968270541"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4394360958"],"abstract_inverted_index":{"Fully":[0],"Homomorphic":[1],"Encryption":[2],"(FHE)":[3],"is":[4,41],"a":[5,17,23,121,137],"cryptographic":[6],"technique":[7],"that":[8,29,54,93,102,141,146],"enables":[9],"privacy-preserving":[10],"computation.":[11],"State-of-the-art":[12],"Boolean":[13,27,45,75,111,131],"FHE":[14,36,46,66,91,132],"implementations":[15],"provide":[16],"very":[18],"low-level":[19],"interface,":[20],"usually":[21],"exposing":[22],"limited":[24],"set":[25],"of":[26,57,71,84,96,139],"gates":[28],"programmers":[30],"must":[31],"use":[32,95],"to":[33,80,99,149],"write":[34],"their":[35,109],"applications.":[37],"This":[38],"programming":[39],"model":[40],"unnecessarily":[42],"restrictive:":[43],"many":[44],"schemes":[47],"support":[48],"programmable":[49,85,97],"bootstrapping":[50,98],",":[51,120],"an":[52,58,90],"operation":[53],"allows":[55],"evaluation":[56],"arbitrary":[59],"fixed-size":[60],"lookup":[61,118],"table.":[62],"However,":[63],"most":[64],"modern":[65],"compilers":[67],"are":[68,103],"only":[69],"capable":[70],"reasoning":[72,127],"about":[73,128],"traditional":[74,110],"circuits,":[76],"and":[77,105],"therefore":[78],"struggle":[79],"take":[81],"full":[82],"advantage":[83],"bootstrapping.":[86],"We":[87,134],"present":[88],"COATL,":[89],"compiler":[92],"makes":[94],"produce":[100],"circuits":[101,115,145],"smaller":[104],"more":[106],"efficient":[107],"than":[108,152],"counterparts.":[112],"COATL":[113,142],"generates":[114],"using":[116],"arithmetic":[117],"tables":[119],"novel":[122],"abstraction":[123],"we":[124],"introduce":[125],"for":[126],"computations":[129],"in":[130],"programs.":[133],"demonstrate":[135],"on":[136],"variety":[138],"benchmarks":[140],"can":[143],"generate":[144],"run":[147],"up":[148],"1.5\u00d7":[150],"faster":[151],"those":[153],"generated":[154],"by":[155],"other":[156],"state-of-the-art":[157],"compilation":[158],"strategies.":[159]},"counts_by_year":[],"updated_date":"2026-08-19T15:00:24.278416","created_date":"2025-10-10T00:00:00"}