{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T13:28:28Z","timestamp":1770902908899,"version":"3.50.1"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032171559","type":"print"},{"value":"9783032171566","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-17156-6_16","type":"book-chapter","created":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:04Z","timestamp":1770899764000},"page":"209-220","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matrix Multiplication in\u00a0the\u00a0MPC Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-6521-9182","authenticated-orcid":false,"given":"Lakshya","family":"Joshi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-3413-0493","authenticated-orcid":false,"given":"Arya","family":"Deshmukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0498-7067","authenticated-orcid":false,"given":"Atharv","family":"Chhabra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0727-160X","authenticated-orcid":false,"given":"Chetan","family":"Gupta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,13]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","unstructured":"Alman, J., Williams, V.V.: A refined laser method and faster matrix multiplication. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA 2021), pp. 522\u2013539 (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.32","DOI":"10.1137\/1.9781611976465.32"},{"issue":"6","key":"16_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s00446-020-00380-5","volume":"34","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel, K., Dory, M., Korhonen, J.H., Leitersdorf, D.: Fast approximate shortest paths in the congested clique. Distrib. Comput. 34(6), 463\u2013487 (2020). https:\/\/doi.org\/10.1007\/s00446-020-00380-5","journal-title":"Distrib. Comput."},{"issue":"6","key":"16_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00446-016-0270-2","volume":"32","author":"K Censor-Hillel","year":"2016","unstructured":"Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. Distrib. Comput. 32(6), 461\u2013478 (2016). https:\/\/doi.org\/10.1007\/s00446-016-0270-2","journal-title":"Distrib. Comput."},{"key":"16_CR4","doi-asserted-by":"publisher","unstructured":"Censor-Hillel, K., Leitersdorf, D., Turner, E.: Sparse matrix multiplication and triangle listing in the congested clique model. In: Proceedings of the OPODIS 2018 (2018). https:\/\/doi.org\/10.4230\/LIPIcs.OPODIS.2018.4","DOI":"10.4230\/LIPIcs.OPODIS.2018.4"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC), pp.\u00a01\u20136 (1987)","DOI":"10.1145\/28395.28396"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","volume":"9","author":"D Coppersmith","year":"1990","unstructured":"Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251\u2013280 (1990)","journal-title":"J. Symb. Comput."},{"key":"16_CR7","doi-asserted-by":"publisher","unstructured":"Gupta, C., Hirvonen, J., Korhonen, J.H., Studen\u00fd, J., Suomela, J.: Sparse matrix multiplication in the low-bandwidth model. In: Agrawal, K., Lee, I.T.A. (eds.) SPAA \u201922: 34th ACM Symposium on Parallelism in Algorithms and Architectures, Philadelphia, PA, USA, July 11\u201314, 2022. pp. 435\u2013444. ACM (2022). https:\/\/doi.org\/10.1145\/3490148.3538575","DOI":"10.1145\/3490148.3538575"},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Gupta, C., Korhonen, J.H., Studen\u00fd, J., Suomela, J., Vahidi, H.: Brief announcement: low-bandwidth matrix multiplication: Faster algorithms and more general forms of sparsity. In: Agrawal, K., Petrank, E. (eds.) Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2024, Nantes, France, June 17\u201321, 2024. pp. 305\u2013307. ACM (2024). https:\/\/doi.org\/10.1145\/3626183.3660270, https:\/\/doi.org\/10.1145\/3626183.3660270","DOI":"10.1145\/3626183.3660270"},{"key":"16_CR9","doi-asserted-by":"publisher","unstructured":"Karloff, H.J., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: Charikar, M. (ed.) Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2010, Austin, Texas, USA, January 17\u201319, 2010. pp. 938\u2013948. SIAM (2010). https:\/\/doi.org\/10.1137\/1.9781611973075.76","DOI":"10.1137\/1.9781611973075.76"},{"key":"16_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/978-3-662-53426-7_5","volume-title":"Distributed Computing","author":"F Le Gall","year":"2016","unstructured":"Le Gall, F.: Further algebraic algorithms in the congested clique model and applications to graph-theoretic problems. In: Gavoille, C., Ilcinkas, D. (eds.) DISC 2016. LNCS, vol. 9888, pp. 57\u201370. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53426-7_5"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Le\u00a0Gall, F.: Powers of tensors and fast matrix multiplication. In: Proceedings of the International Symposium on Symbolic and Algebraic Computation (ISSAC), pp. 296\u2013303. ACM (2014)","DOI":"10.1145\/2608628.2608664"},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Pan, C.: Strassen\u2019s algorithm is not optimal. Trilinear technique of aggregating, uniting and canceling for constructing fast algorithms for matrix operations. In: 19th Annual Symposium on Foundations of Computer Science (FOCS), pp. 166\u2013174. IEEE (1978)","DOI":"10.1109\/SFCS.1978.34"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Vassilevska\u00a0Williams, V.: Multiplying matrices faster than coppersmith\u2013winograd. In: Proceedings of the 44th Annual ACM Symposium on Theory of Computing (STOC), pp. 887\u2013898 (2012)","DOI":"10.1145\/2213977.2214056"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-17156-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:36:07Z","timestamp":1770899767000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-17156-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032171559","9783032171566"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-17156-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"13 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CALDAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Conference on Algorithms and Discrete Applied Mathematics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dharwad","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 February 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 February 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"caldam2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caldam2026.iitdh.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}