{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:40:05Z","timestamp":1755880805997,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,17]],"date-time":"2024-06-17T00:00:00Z","timestamp":1718582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Swiss National Science Foundation","award":["200021 204787"],"award-info":[{"award-number":["200021 204787"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,6,17]]},"DOI":"10.1145\/3626183.3659987","type":"proceedings-article","created":{"date-parts":[[2024,6,4]],"date-time":"2024-06-04T18:23:04Z","timestamp":1717525384000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["A Framework for Parallelizing Approximate Gaussian Elimination"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-6901-7479","authenticated-orcid":false,"given":"Yves","family":"Baumann","sequence":"first","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8268-6258","authenticated-orcid":false,"given":"Rasmus","family":"Kyng","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. arxiv","author":"Behnezhad Soheil","year":"1909","unstructured":"Soheil Behnezhad, Mahsa Derakhshan, MohammadTaghi Hajiaghayi, Cliff Stein, and Madhu Sudan. 2019. Fully Dynamic Maximal Independent Set with Polylogarithmic Update Time. arxiv: 1909.03478 [cs.DS]"},{"doi-asserted-by":"crossref","unstructured":"Erik Boman Bruce Hendrickson and Stephen Vavasis. 2008. Solving Elliptic Finite Element Systems in Near-Linear Time with Support Preconditioners. arxiv: cs\/0407022 [cs.NA]","key":"e_1_3_2_1_2_1","DOI":"10.1137\/040611781"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1145\/3291525"},{"key":"e_1_3_2_1_4_1","volume-title":"Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. arxiv","author":"Chechik Shiri","year":"1909","unstructured":"Shiri Chechik and Tianyi Zhang. 2021. Fully Dynamic Maximal Independent Set in Expected Poly-Log Update Time. arxiv: 1909.03445 [cs.DS]"},{"key":"e_1_3_2_1_5_1","volume-title":"RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems. arxiv","author":"Chen Chao","year":"2021","unstructured":"Chao Chen, Tianyu Liang, and George Biros. 2021. RCHOL: Randomized Cholesky Factorization for Solving SDD Linear Systems. arxiv: 2011.07769 [math.NA]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/2591796.2591833"},{"key":"e_1_3_2_1_7_1","volume-title":"Spielman","author":"Daitch Samuel I.","year":"2008","unstructured":"Samuel I. Daitch and Daniel A. Spielman. 2008. Faster Approximate Lossy Generalized Flow via Interior Point Algorithms. arxiv: 0803.0988 [cs.DS]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/3210377.3210414"},{"key":"e_1_3_2_1_9_1","volume-title":"Spielman","author":"Gao Yuan","year":"2023","unstructured":"Yuan Gao, Rasmus Kyng, and Daniel A. Spielman. 2023. Robust and Practical Solution of Laplacian Equations by Approximate Elimination. arxiv: 2303.00709 [math.NA]"},{"key":"e_1_3_2_1_10_1","volume-title":"Parallel Weighted Random Sampling. arxiv","author":"H\u00fcbschle-Schneider Lorenz","year":"1903","unstructured":"Lorenz H\u00fcbschle-Schneider and Peter Sanders. 2021. Parallel Weighted Random Sampling. arxiv: 1903.00227 [cs.DS]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1137\/1.9781611976465.33"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1145\/2488608.2488724"},{"doi-asserted-by":"crossref","unstructured":"Ioannis Koutis. 2014. Simple parallel and distributed algorithms for spectral graph sparsification. arxiv: 1402.3851 [cs.DS]","key":"e_1_3_2_1_13_1","DOI":"10.1145\/2612669.2612676"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1109\/FOCS.2010.29"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/FOCS.2011.85"},{"volume-title":"Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing. 842--850","author":"Kyng Rasmus","unstructured":"Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman. 2016. Sparsified Cholesky and Multigrid Solvers for Connection Laplacians. In Proceedings of the Forty-Eighth Annual ACM Symposium on Theory of Computing. 842--850.","key":"e_1_3_2_1_16_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1109\/FOCS.2016.68"},{"key":"e_1_3_2_1_18_1","volume-title":"Spielman","author":"Lee Yin Tat","year":"2015","unstructured":"Yin Tat Lee, Richard Peng, and Daniel A. Spielman. 2015. Sparsified Cholesky Solvers for SDD linear systems. arxiv: 1506.08204 [cs.DS]"},{"key":"e_1_3_2_1_19_1","volume-title":"Spielman","author":"Peng Richard","year":"2013","unstructured":"Richard Peng and Daniel A. Spielman. 2013. An Efficient Parallel Solver for SDD Linear Systems. arxiv: 1311.3286 [cs.NA]"},{"volume-title":"Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing. 333--342","author":"Peng Richard","unstructured":"Richard Peng and Daniel A. Spielman. 2014. An Efficient Parallel Solver for SDD Linear Systems. In Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing. 333--342.","key":"e_1_3_2_1_20_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3558481.3591101"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/1007352.1007372"},{"doi-asserted-by":"crossref","unstructured":"Joel A. Tropp. 2011a. Freedman's inequality for matrix martingales. arxiv: 1101.3039 [math.PR]","key":"e_1_3_2_1_23_1","DOI":"10.1214\/ECP.v16-1624"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/s10208-011--9099-z"}],"event":{"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"],"acronym":"SPAA '24","name":"SPAA '24: 36th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Nantes France"},"container-title":["Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659987","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626183.3659987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T16:23:18Z","timestamp":1755879798000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626183.3659987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,17]]},"references-count":24,"alternative-id":["10.1145\/3626183.3659987","10.1145\/3626183"],"URL":"https:\/\/doi.org\/10.1145\/3626183.3659987","relation":{},"subject":[],"published":{"date-parts":[[2024,6,17]]},"assertion":[{"value":"2024-06-17","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}