{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T22:24:53Z","timestamp":1766269493448,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,7,6]],"date-time":"2020-07-06T00:00:00Z","timestamp":1593993600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,7,6]]},"DOI":"10.1145\/3350755.3400210","type":"proceedings-article","created":{"date-parts":[[2020,7,9]],"date-time":"2020-07-09T15:56:12Z","timestamp":1594310172000},"page":"329-338","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Spectral Lower Bounds on the I\/O Complexity of Computation Graphs"],"prefix":"10.1145","author":[{"given":"Saachi","family":"Jain","sequence":"first","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]},{"given":"Matei","family":"Zaharia","sequence":"additional","affiliation":[{"name":"Stanford University, Stanford, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2020,7,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975482.107"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486159.2486196"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2395116.2395121"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321111"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s002240000131"},{"key":"e_1_3_2_1_6_1","volume-title":"On the spectra of general random graphs. the electronic journal of combinatorics","author":"Chung Fan","year":"2011","unstructured":"Fan Chung and Mary Radcliffe . 2011. On the spectra of general random graphs. the electronic journal of combinatorics ( 2011 ), P215--P215. Fan Chung and Mary Radcliffe. 2011. On the spectra of general random graphs. the electronic journal of combinatorics (2011), P215--P215."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.10085"},{"volume-title":"North-Holland Mathematics Studies.","author":"Finke Gerd","key":"e_1_3_2_1_10_1","unstructured":"Gerd Finke , Rainer E Burkard , and Franz Rendl . 1987. Quadratic assignment problems . In North-Holland Mathematics Studies. Vol. 132 . Elsevier , 61--82. Gerd Finke, Rainer E Burkard, and Franz Rendl. 1987. Quadratic assignment problems. In North-Holland Mathematics Studies. Vol. 132. Elsevier, 61--82."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0110015"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2004.03.021"},{"key":"e_1_3_2_1_13_1","volume-title":"Spectral Lower Bounds on the I\/O Complexity of Computation Graphs. arXiv preprint arXiv:1909.09791","author":"Jain Saachi","year":"2020","unstructured":"Saachi Jain and Matei Zaharia . 2020. Spectral Lower Bounds on the I\/O Complexity of Computation Graphs. arXiv preprint arXiv:1909.09791 ( 2020 ). Saachi Jain and Matei Zaharia. 2020. Spectral Lower Bounds on the I\/O Complexity of Computation Graphs. arXiv preprint arXiv:1909.09791 (2020)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/800076.802486"},{"key":"e_1_3_2_1_15_1","volume-title":"Algebraic connectivity of Erd\u00f6s-R\u00e9nyi graphs near the connectivity threshold. Manuscript in preparation","author":"Kolokolnikov Theodore","year":"2014","unstructured":"Theodore Kolokolnikov , Braxton Osting , and James Von Brecht . 2014. Algebraic connectivity of Erd\u00f6s-R\u00e9nyi graphs near the connectivity threshold. Manuscript in preparation ( 2014 ). Theodore Kolokolnikov, Braxton Osting, and James Von Brecht. 2014. Algebraic connectivity of Erd\u00f6s-R\u00e9nyi graphs near the connectivity threshold. Manuscript in preparation (2014)."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2755573.2755594"}],"event":{"name":"SPAA '20: 32nd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '20"},"container-title":["Proceedings of the 32nd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400210","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3350755.3400210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:13:34Z","timestamp":1750202014000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3350755.3400210"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,6]]},"references-count":14,"alternative-id":["10.1145\/3350755.3400210","10.1145\/3350755"],"URL":"https:\/\/doi.org\/10.1145\/3350755.3400210","relation":{},"subject":[],"published":{"date-parts":[[2020,7,6]]},"assertion":[{"value":"2020-07-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}