{"id":"https://openalex.org/W4285008797","doi":"https://doi.org/10.1145/3490148.3538551","title":"Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms","display_name":"Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms","publication_year":2022,"publication_date":"2022-07-10","ids":{"openalex":"https://openalex.org/W4285008797","doi":"https://doi.org/10.1145/3490148.3538551"},"language":"en","primary_location":{"id":"doi:10.1145/3490148.3538551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","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/A5110486143","display_name":"Lorenzo De Stefani","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lorenzo De Stefani","raw_affiliation_strings":["Brown University, Providence, RI, USA"],"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110486143"],"corresponding_institution_ids":["https://openalex.org/I27804330"],"apc_list":null,"apc_paid":null,"fwci":0.6808,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65475526,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"449","last_page":"452"},"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.9994999766349792,"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.9994999766349792,"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/T11130","display_name":"Coding theory and cryptography","score":0.9991000294685364,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/integer","display_name":"Integer (computer science)","score":0.661126971244812},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6240523457527161},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.614330530166626},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5789222717285156},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.511585533618927},{"id":"https://openalex.org/keywords/asymptotically-optimal-algorithm","display_name":"Asymptotically optimal algorithm","score":0.4880291521549225},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4830096960067749},{"id":"https://openalex.org/keywords/multiplicative-function","display_name":"Multiplicative function","score":0.46104544401168823},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.43893927335739136},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42813345789909363},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.42807698249816895},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3988815248012543},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3071422576904297},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2381691336631775},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.07038703560829163}],"concepts":[{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.661126971244812},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6240523457527161},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.614330530166626},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5789222717285156},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.511585533618927},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.4880291521549225},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4830096960067749},{"id":"https://openalex.org/C42747912","wikidata":"https://www.wikidata.org/wiki/Q1048447","display_name":"Multiplicative function","level":2,"score":0.46104544401168823},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.43893927335739136},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42813345789909363},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.42807698249816895},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3988815248012543},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3071422576904297},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2381691336631775},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.07038703560829163},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3490148.3538551","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3490148.3538551","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1564514837","https://openalex.org/W1754110195","https://openalex.org/W1972501001","https://openalex.org/W2001121794","https://openalex.org/W2083368929","https://openalex.org/W2087957223","https://openalex.org/W2165156793","https://openalex.org/W2903237208","https://openalex.org/W2962979000"],"related_works":["https://openalex.org/W2372139915","https://openalex.org/W2356663714","https://openalex.org/W2065197237","https://openalex.org/W2156759588","https://openalex.org/W3172154325","https://openalex.org/W2949327565","https://openalex.org/W2571088576","https://openalex.org/W2288770986","https://openalex.org/W1900852564","https://openalex.org/W1989110033"],"abstract_inverted_index":{"Almost":[0],"asymptotically":[1,130,172],"tight":[2,131,173,176],"lower":[3,90,133,164,168,201,213],"bounds":[4,169,202,214],"are":[5,113,170,215],"derived":[6,216],"for":[7,92,135,177,203,217],"the":[8,22,61,93,107,136,162,166,212,218,241],"Input/Output":[9],"(I/O)":[10],"complexity":[11,71,95,120,138],"IOA(n,":[12],"M)":[13],"of":[14,18,24,45,96,99,110,139,161,180,206,222,250],"a":[15,33,38,97,123,157,187,233],"general":[16,220],"class":[17,98,152,221],"hybrid":[19,58,102,148,207,225],"algorithms":[20,59,78,117,149,226],"computing":[21,238],"product":[23],"two":[25],"integers,":[26],"each":[27],"represented":[28],"with":[29,42,48,69,118,191,240],"n":[30],"digits":[31,50],"in":[32,37,52],"given":[34],"base":[35],"s,":[36],"two-level":[39],"storage":[40],"hierarchy":[41],"M":[43],"words":[44],"fast":[46,65],"memory,":[47],"different":[49,53,234,248],"stored":[51],"memory":[54,189],"words.":[55],"The":[56],"considered":[57],"combine":[60],"Toom-Cook-k":[62],"(or":[63],"Toom-k)":[64],"integer":[66,76,142,208],"multiplication":[67,77,143,209],"approach":[68],"computational":[70],"\u0398(cknlogk":[72],"(2k-1)),":[73],"and":[74,174,198,245],"\"standard\"":[75],"which":[79,112],"compute":[80],"\u03a9(n2)":[81],"digit":[82],"multiplications.":[83],"We":[84],"present":[85],"an":[86,129],"\u03a9((n/max(M,n0))logk":[87],"(2k-1)":[88],"(max(1,n_0/M))2M)":[89],"bound":[91,134],"I/O":[94,137,154,200],"\"uniform,":[100],"non-stationary\"":[101,224],"algorithms,":[103],"where":[104],"n0":[105],"denotes":[106],"threshold":[108],"size":[109],"sub-problems":[111,239],"computed":[114],"using":[115],"standard":[116,141],"algebraic":[119],"\u03a9(n2).":[121],"As":[122,145],"special":[124],"case,":[125],"our":[126],"result":[127],"yields":[128],"\u03a9(n2/M)":[132],"any":[140],"algorithm.":[144],"some":[146],"sequential":[147],"from":[150],"this":[151],"exhibit":[153],"cost":[155],"within":[156],"O(k2)":[158],"multiplicative":[159],"term":[160],"corresponding":[163],"bounds,":[165],"proposed":[167],"almost":[171],"indeed":[175],"constant":[178],"values":[179],"k.":[181],"By":[182],"extending":[183],"these":[184],"results":[185],"to":[186,231,246],"distributed":[188],"model":[190],"P":[192],"processors,":[193],"we":[194],"obtain":[195],"both":[196],"memory-dependent":[197],"memory-independent":[199],"parallel":[204],"versions":[205,249],"algorithms.":[210],"All":[211],"more":[219],"\"non-uniform,":[223],"that":[227],"allow":[228],"recursive":[229],"calls":[230],"have":[232],"structure,":[235],"even":[236],"when":[237],"same":[242],"input":[243],"size,":[244],"use":[247],"Toom-k.":[251]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}