{"id":"https://openalex.org/W3027938384","doi":"https://doi.org/10.1145/3350755.3400210","title":"Spectral Lower Bounds on the I/O Complexity of Computation Graphs","display_name":"Spectral Lower Bounds on the I/O Complexity of Computation Graphs","publication_year":2020,"publication_date":"2020-07-06","ids":{"openalex":"https://openalex.org/W3027938384","doi":"https://doi.org/10.1145/3350755.3400210","mag":"3027938384"},"language":"en","primary_location":{"id":"doi:10.1145/3350755.3400210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1909.09791","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5102487928","display_name":"Saachi Jain","orcid":null},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Saachi Jain","raw_affiliation_strings":["Stanford University, Stanford, CA, USA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005554337","display_name":"Matei Zaharia","orcid":"https://orcid.org/0000-0002-7547-7204"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matei Zaharia","raw_affiliation_strings":["Stanford University, Stanford, CA, USA","Stanford University ()"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]},{"raw_affiliation_string":"Stanford University ()","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5102487928"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.08795028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"329","last_page":"338"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9998000264167786,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9991000294685364,"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/computation","display_name":"Computation","score":0.6152754426002502},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5064488649368286},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4982438087463379},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4837658405303955},{"id":"https://openalex.org/keywords/laplacian-matrix","display_name":"Laplacian matrix","score":0.47903648018836975},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4678870737552643},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3775050640106201},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22440150380134583}],"concepts":[{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6152754426002502},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5064488649368286},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4982438087463379},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4837658405303955},{"id":"https://openalex.org/C115178988","wikidata":"https://www.wikidata.org/wiki/Q772067","display_name":"Laplacian matrix","level":3,"score":0.47903648018836975},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4678870737552643},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3775050640106201},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22440150380134583},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3350755.3400210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3350755.3400210","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1909.09791","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.09791","pdf_url":"https://arxiv.org/pdf/1909.09791","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"mag:3027938384","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1909.09791.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1909.09791","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1909.09791","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1909.09791","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1909.09791","pdf_url":"https://arxiv.org/pdf/1909.09791","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1861310076","display_name":null,"funder_award_id":"CNS-1651570","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","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"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"},{"id":"https://openalex.org/F4320316785","display_name":"VMware","ror":null},{"id":"https://openalex.org/F4320330001","display_name":"Ant Financial Services Group","ror":null}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W3027938384.pdf"},"referenced_works_count":17,"referenced_works":["https://openalex.org/W1560797355","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1972501001","https://openalex.org/W2007845450","https://openalex.org/W2010747199","https://openalex.org/W2020570543","https://openalex.org/W2038729923","https://openalex.org/W2061851195","https://openalex.org/W2062647401","https://openalex.org/W2130270608","https://openalex.org/W2139316564","https://openalex.org/W2164946224","https://openalex.org/W2735702203","https://openalex.org/W2883221138","https://openalex.org/W2963933718","https://openalex.org/W4233979608"],"related_works":["https://openalex.org/W3041514855","https://openalex.org/W60403651","https://openalex.org/W1995968692","https://openalex.org/W2770207651","https://openalex.org/W3214333250","https://openalex.org/W1987758573","https://openalex.org/W2045501273","https://openalex.org/W2952965188","https://openalex.org/W2341570704","https://openalex.org/W3159345262","https://openalex.org/W2949343847","https://openalex.org/W2038469103","https://openalex.org/W50642151","https://openalex.org/W3099434145","https://openalex.org/W2889277816","https://openalex.org/W1978491945","https://openalex.org/W1522653943","https://openalex.org/W3126958641","https://openalex.org/W3201965115","https://openalex.org/W1982549992"],"abstract_inverted_index":{"We":[0,88,121,160],"consider":[1],"the":[2,9,33,46,73,80,85,94,139,144],"problem":[3,142],"of":[4,12,22,75,84],"finding":[5,41],"lower":[6,43],"bounds":[7,44,130,176],"on":[8,131,165],"I/O":[10,42,74,187],"complexity":[11],"arbitrary":[13,60],"computations":[14,24],"in":[15,113],"a":[16,68,152],"two":[17,132],"level":[18],"memory":[19],"hierarchy.":[20],"Executions":[21],"complex":[23],"can":[25,109],"be":[26,57,111],"formalized":[27],"as":[28,148,150],"an":[29],"evaluation":[30],"order":[31],"over":[32],"underlying":[34],"computation":[35,77,133,167],"graph.":[36],"However,":[37],"prior":[38],"methods":[39,180],"for":[40,49,116,138,155],"leverage":[45],"graph":[47,78],"structures":[48],"specific":[50],"problems":[51],"(e.g":[52],"matrix":[53],"multiplication)":[54],"which":[55],"cannot":[56],"applied":[58],"to":[59,71,93,126,184],"graphs.":[61,159],"In":[62],"this":[63,91],"paper,":[64],"we":[65],"first":[66,81],"present":[67],"novel":[69],"method":[70,125,173],"bound":[72,92,99,154,164],"any":[76],"using":[79],"few":[82],"eigenvalues":[83],"graph's":[86],"Laplacian.":[87],"further":[89],"extend":[90],"parallel":[95],"setting.":[96],"This":[97],"spectral":[98,124],"is":[100],"not":[101],"only":[102],"efficiently":[103],"computable":[104],"by":[105],"power":[106],"iteration,":[107],"but":[108],"also":[110],"computed":[112],"closed":[114],"form":[115],"graphs":[117,134],"with":[118],"known":[119],"spectra.":[120],"apply":[122],"our":[123,163,172],"compute":[127],"closed-form":[128],"analytical":[129],"(the":[135],"Bellman-Held-Karp":[136],"algorithm":[137],"traveling":[140],"salesman":[141],"and":[143,169,181],"Fast":[145],"Fourier":[146],"Transform),":[147],"well":[149],"provide":[151],"probabilistic":[153],"random":[156],"Erdos":[157],"Renyi":[158],"empirically":[161],"validate":[162],"four":[166],"graphs,":[168],"find":[170],"that":[171],"provides":[174],"tighter":[175],"than":[177],"current":[178],"empirical":[179],"behaves":[182],"similarly":[183],"previously":[185],"published":[186],"bounds.":[188]},"counts_by_year":[],"updated_date":"2026-03-18T14:38:29.013473","created_date":"2025-10-10T00:00:00"}