{"id":"https://openalex.org/W2061851195","doi":"https://doi.org/10.1145/2755573.2755594","title":"Matrix Multiplication I/O-Complexity by Path Routing","display_name":"Matrix Multiplication I/O-Complexity by Path Routing","publication_year":2015,"publication_date":"2015-06-12","ids":{"openalex":"https://openalex.org/W2061851195","doi":"https://doi.org/10.1145/2755573.2755594","mag":"2061851195"},"language":"en","primary_location":{"id":"doi:10.1145/2755573.2755594","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th 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/A5018126671","display_name":"Jacob Scott","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jacob Scott","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA","University of California, at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055605632","display_name":"Olga Holtz","orcid":"https://orcid.org/0000-0003-3420-3423"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Olga Holtz","raw_affiliation_strings":["University of California at Berkeley, Berkeley, USA","University of California, at Berkeley, Berkeley, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"University of California, at Berkeley, Berkeley, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010957839","display_name":"Oded Schwartz","orcid":"https://orcid.org/0000-0003-1309-5566"},"institutions":[{"id":"https://openalex.org/I197251160","display_name":"Hebrew University of Jerusalem","ror":"https://ror.org/03qxff017","country_code":"IL","type":"education","lineage":["https://openalex.org/I197251160"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Oded Schwartz","raw_affiliation_strings":["The Hebrew University of Jerusalem, Jerusalem, Israel","The Hebrew University of Jerusalem , Jerusalem , Israel"],"affiliations":[{"raw_affiliation_string":"The Hebrew University of Jerusalem, Jerusalem, Israel","institution_ids":["https://openalex.org/I197251160"]},{"raw_affiliation_string":"The Hebrew University of Jerusalem , Jerusalem , Israel","institution_ids":["https://openalex.org/I197251160"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5018126671"],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":1.9969,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.88045701,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"35","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9995999932289124,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9994000196456909,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/strassen-algorithm","display_name":"Strassen algorithm","score":0.9914487600326538},{"id":"https://openalex.org/keywords/matrix-multiplication","display_name":"Matrix multiplication","score":0.7720146179199219},{"id":"https://openalex.org/keywords/multiplication-algorithm","display_name":"Multiplication algorithm","score":0.5566419959068298},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5314798355102539},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5234087109565735},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47719085216522217},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4661950170993805},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46473124623298645},{"id":"https://openalex.org/keywords/multiplication","display_name":"Multiplication (music)","score":0.450906902551651},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.44265180826187134},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.44097018241882324},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.4351615905761719},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4295845329761505},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38963136076927185},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3459509015083313},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.23577740788459778},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.11143729090690613}],"concepts":[{"id":"https://openalex.org/C39096654","wikidata":"https://www.wikidata.org/wiki/Q728507","display_name":"Strassen algorithm","level":4,"score":0.9914487600326538},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.7720146179199219},{"id":"https://openalex.org/C201290732","wikidata":"https://www.wikidata.org/wiki/Q130762","display_name":"Multiplication algorithm","level":3,"score":0.5566419959068298},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5314798355102539},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5234087109565735},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47719085216522217},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4661950170993805},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46473124623298645},{"id":"https://openalex.org/C2780595030","wikidata":"https://www.wikidata.org/wiki/Q3860309","display_name":"Multiplication (music)","level":2,"score":0.450906902551651},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.44265180826187134},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.44097018241882324},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.4351615905761719},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4295845329761505},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38963136076927185},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3459509015083313},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.23577740788459778},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.11143729090690613},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2755573.2755594","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2755573.2755594","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320878","display_name":"Minerva Foundation","ror":"https://ror.org/02rxjts25"},{"id":"https://openalex.org/F4320322248","display_name":"Israel Academy of Sciences and Humanities","ror":"https://ror.org/03c6c9520"},{"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":17,"referenced_works":["https://openalex.org/W1502773390","https://openalex.org/W1507218610","https://openalex.org/W1744930860","https://openalex.org/W1950718439","https://openalex.org/W1972501001","https://openalex.org/W1986272312","https://openalex.org/W1996440503","https://openalex.org/W2010747199","https://openalex.org/W2023122441","https://openalex.org/W2032839380","https://openalex.org/W2078644732","https://openalex.org/W2090322880","https://openalex.org/W2099611016","https://openalex.org/W2104373803","https://openalex.org/W2157323434","https://openalex.org/W2164946224","https://openalex.org/W3100417409"],"related_works":["https://openalex.org/W2170716619","https://openalex.org/W2949595835","https://openalex.org/W2039853057","https://openalex.org/W2392656174","https://openalex.org/W3204033665","https://openalex.org/W2269364368","https://openalex.org/W2032839380","https://openalex.org/W1809313304","https://openalex.org/W4301181185","https://openalex.org/W2164946224"],"abstract_inverted_index":{"We":[0,118],"apply":[1,98],"a":[2,85,123],"novel":[3],"technique":[4],"based":[5],"on":[6],"path":[7],"routings":[8],"to":[9,59,99],"obtain":[10],"optimal":[11],"I/O-complexity":[12,45,129],"lower":[13,46,87,130],"bounds":[14,131],"for":[15,52,89,127],"all":[16],"Strassen-like":[17,54],"fast":[18,37],"matrix":[19,55,91],"multiplication":[20,56,92],"algorithms":[21,100,113],"computed":[22],"in":[23,26],"serial":[24],"or":[25,104,112],"parallel,":[27],"assuming":[28],"no":[29],"reuse":[30],"of":[31,39,48,64,107,135],"nontrivial":[32],"intermediate":[33],"linear":[34],"combinations.":[35],"Given":[36],"memory":[38],"size":[40],"M,":[41],"we":[42],"prove":[43],"an":[44,75],"bound":[47,88],"\u03a9((n/\u221aM}\u03c90":[49],"\u2022":[50],"M)":[51],"any":[53],"algorithm":[57,93],"applied":[58],"n":[60,62],"x":[61],"matrices":[63],"arithmetic":[65],"complexity":[66],"\u0398(n\u03c90)":[67],"with":[68,101,114],"\u03c90<3":[69],"under":[70],"this":[71],"assumption.":[72],"This":[73],"generalizes":[74],"approach":[76,126],"by":[77],"Ballard,":[78],"Demmel,":[79],"Holtz,":[80],"and":[81],"Schwartz":[82],"that":[83],"provides":[84],"tight":[86],"Strassen's":[90],"but":[94],"which":[95],"does":[96],"not":[97],"disconnected":[102],"encoding":[103],"decoding":[105],"components":[106],"the":[108,133],"underlying":[109],"computation":[110],"graph":[111],"multiply":[115],"copied":[116],"values.":[117],"overcome":[119],"these":[120],"challenges":[121],"via":[122],"new":[124],"graph-theoretical":[125],"proving":[128],"without":[132],"use":[134],"edge":[136],"expansions.":[137]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":6},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}