{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T04:16:50Z","timestamp":1777954610699,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,7,16]]},"DOI":"10.1145\/3694906.3743353","type":"proceedings-article","created":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T16:19:56Z","timestamp":1752682796000},"page":"593-597","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Brief Announcement: Fine-Grained Computation in 3-Space: Matrix Multiplication, Paths, and Mazes"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8047-7348","authenticated-orcid":false,"given":"Quentin F.","family":"Stout","sequence":"first","affiliation":[{"name":"University of Michigan, Ann Arbor, Michigan, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,7,16]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.395.0575"},{"key":"e_1_3_2_1_2_1","unstructured":"Amazon. 2021. Amazon Trainium processor. aws.amazon.com\/machine-learning\/trainium."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"G Ballard J Demmel A Gearhart B Lipshitz Y Oltchik O Schwartz and S Toledo. 2016. Network topologies and inevitable contention. In First Work. Optimization Comm. HPC Runtime Sys. 39--52.","DOI":"10.1109\/COMHPC.2016.010"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2312005.2312044"},{"key":"e_1_3_2_1_5_1","unstructured":"WT Beyer. 1969. Recognition of Topological Invariants by Iterative Arrays. Ph.D. Dissertation. MIT."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"R Duan and S Pettie. 2009. Fast algorithms for (max min)-matrix multiplication and bottleneck shortest paths. In SODA. 384--391.","DOI":"10.1137\/1.9781611973068.43"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/322047.322057"},{"key":"e_1_3_2_1_8_1","unstructured":"Google. 2023. Google Tensor processing unit. cloud.google.com\/tpu\/docs\/system-architecture-tpu-vm."},{"key":"e_1_3_2_1_9_1","volume-title":"High-performance biocomputing in synthetic biology--integrated transcriptional and metabolic circuits. Bioeng. Biotechnol. 7","author":"Go\u00f1i-Moreno A","year":"2019","unstructured":"A Go\u00f1i-Moreno and NI Nikil. 2019. High-performance biocomputing in synthetic biology--integrated transcriptional and metabolic circuits. Bioeng. Biotechnol. 7 (2019)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"L Grozinger M Amos TE Gorochowski P Carbonell DA Oyarz\u00fan R Stoof H Fellermann P Zuliani H Tas and A Go\u00f1i-Moreno. 2019. Pathways to cellular supremacy in biocomputing. Nature Comm. (2019) 10:5250.","DOI":"10.1038\/s41467-019-13232-z"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1511\/2001.22.204"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1152"},{"key":"#cr-split#-e_1_3_2_1_13_1.1","unstructured":"H Jeong Y Yang V Gupta C Engelmann TM Low V Cadambe K Ramchandran and P Grover. 2020. 3D Coded SUMMA"},{"key":"#cr-split#-e_1_3_2_1_13_1.2","doi-asserted-by":"crossref","unstructured":"Communication-efficient and robust parallel matrix multiplication. In Euro-Par 2020: Parallel Processing. 392--407.","DOI":"10.1007\/978-3-030-57675-2_25"},{"key":"e_1_3_2_1_14_1","first-page":"408","article-title":"Optimal sorting on multi-dimensionally mesh-connected computers","volume":"87","author":"Kunde M","year":"1987","unstructured":"M Kunde. 1987. Optimal sorting on multi-dimensionally mesh-connected computers. STACS 87 (1987), 408--419.","journal-title":"STACS"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356181"},{"key":"e_1_3_2_1_16_1","volume-title":"14th ACM Symp. Theory Computing (STOC). 85--98","author":"Leighton FT","year":"1982","unstructured":"FT Leighton. 1982. A layout strategy for VLSI which is provably good. In 14th ACM Symp. Theory Computing (STOC). 85--98."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"FT Leighton. 1992. Introduction to Parallel Algorithms and Architectures: Arrays Trees Hypercubes. Morgan Kaufmann.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0215057"},{"key":"e_1_3_2_1_19_1","unstructured":"CE Leiserson. 1989. VLSI theory and supercomputing. Technical Report. MIT\/LCS\/TM-402."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.1985.4767645"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5232.001.0001"},{"key":"e_1_3_2_1_22_1","unstructured":"ML Minsky and SA Papert. 1969. Perceptrons. MIT Press."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1510825113"},{"key":"e_1_3_2_1_24_1","unstructured":"VF Pavidis and EG Friedman. 2009. Three-Dimensional Integrated Circuit Design. Morgan Kaufmann."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"AL Rosenberg. 1981. Three-dimensional integrated circuity. In VLSI Systems and Computations HT Kung B Sproull and G Steele (Eds.). 69--80.","DOI":"10.1007\/978-3-642-68402-9_9"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/140993478"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0210032"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-009-9328-x"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23397-5_10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.48"},{"key":"e_1_3_2_1_31_1","first-page":"148","article-title":"Optimal component labeling algorithms for mesh-connected computers and VLSI","volume":"5","author":"Stout QF","year":"1984","unstructured":"QF Stout. 1984. Optimal component labeling algorithms for mesh-connected computers and VLSI. Abstracts AMS 5 (1984), 148. arXiv:1502.01435.","journal-title":"Abstracts AMS"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02165411"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/181014.181022"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/359461.359481"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1167704.1167715"},{"key":"e_1_3_2_1_36_1","volume-title":"Future computers: digital, quantum, biological. Computer","author":"Trevleaven P","year":"2021","unstructured":"P Trevleaven. 2021. Future computers: digital, quantum, biological. Computer (2021)."},{"key":"e_1_3_2_1_37_1","volume-title":"Computational Aspects of VLSI","author":"Ullman JD","unstructured":"JD Ullman. 1984. Computational Aspects of VLSI. Computer Science Press."},{"key":"e_1_3_2_1_38_1","first-page":"255","article-title":"SUMMA: scalable universal matrix multiplication algorithm. Concurrency","volume":"9","author":"van de Geijn RA","year":"1997","unstructured":"RA van de Geijn and A Watts. 1997. SUMMA: scalable universal matrix multiplication algorithm. Concurrency: Prac. and Exper. 9 (1997), 255--274.","journal-title":"Prac. and Exper."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1980.1675627"},{"key":"e_1_3_2_1_40_1","unstructured":"wikipedia. 2025. Biological Computing. en.wikipedia.org\/wiki\/Biological_computing."},{"key":"e_1_3_2_1_41_1","unstructured":"wikipedia. 2025. Three-dimensional integrated circuit."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.67"}],"event":{"name":"SPAA '25: 37th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Portland OR USA","acronym":"SPAA '25","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"]},"container-title":["Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3694906.3743353","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,4]],"date-time":"2026-05-04T19:20:09Z","timestamp":1777922409000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3694906.3743353"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,7,16]]},"references-count":43,"alternative-id":["10.1145\/3694906.3743353","10.1145\/3694906"],"URL":"https:\/\/doi.org\/10.1145\/3694906.3743353","relation":{},"subject":[],"published":{"date-parts":[[2025,7,16]]},"assertion":[{"value":"2025-07-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}