{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,20]],"date-time":"2025-07-20T03:34:39Z","timestamp":1752982479674,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T00:00:00Z","timestamp":1686873600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100002428","name":"Austrian Science Fund","doi-asserted-by":"publisher","award":["P 32863-N"],"award-info":[{"award-number":["P 32863-N"]}],"id":[{"id":"10.13039\/501100002428","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["947702"],"award-info":[{"award-number":["947702"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,6,19]]},"DOI":"10.1145\/3583668.3594577","type":"proceedings-article","created":{"date-parts":[[2023,6,16]],"date-time":"2023-06-16T22:28:38Z","timestamp":1686954518000},"page":"75-78","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Brief Announcement: The Laplacian Paradigm in Deterministic Congested Clique"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2191-3381","authenticated-orcid":false,"given":"Sebastian","family":"Forster","sequence":"first","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1417-6387","authenticated-orcid":false,"given":"Tijn","family":"de Vos","sequence":"additional","affiliation":[{"name":"University of Salzburg, Salzburg, Austria"}]}],"member":"320","published-online":{"date-parts":[[2023,6,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs","volume":"20","author":"Anagnostides Ioannis","year":"2022","unstructured":"Ioannis Anagnostides, Christoph Lenzen, Bernhard Haeupler, Goran Zuzic, and Themis Gouleakis. 2022. Almost Universally Optimal Distributed Laplacian Solvers via Low-Congestion Shortcuts. In Proc. of the 36th International Symposium on Distributed Computing, DISC 2022 (LIPIcs, Vol. 246). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, 6:1--6:20. arXiv:2109.05151 Announced at PODC 2022."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384321"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00018"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1137\/19M1286955"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0270-2"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00043"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00111"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236717"},{"key":"e_1_3_2_1_10_1","volume-title":"Proc. of the Symposium on Theory of Computing, STOC","author":"Cohen Michael B.","year":"2014","unstructured":"Michael B. Cohen, Rasmus Kyng, Gary L. Miller, Jakub W. Pachocki, Richard Peng, Anup B. Rao, and Shen Chen Xu. 2014. Solving SDD linear systems in nearly mlog1\/2 n time. In Proc. of the Symposium on Theory of Computing, STOC 2014. ACM, 343--352."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.48"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80023-7"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519270.3538436"},{"key":"e_1_3_2_1_15_1","volume-title":"Proc. of the 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE, 989--999","author":"Forster Sebastian","year":"2021","unstructured":"Sebastian Forster, Gramoz Goranci, Yang P. Liu, Richard Peng, Xiaorui Sun, and Mingquan Ye. 2021. Minor Sparsifiers and the Distributed Laplacian Paradigm. In Proc. of the 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021. IEEE, 989--999. arXiv:2012.15675"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch16"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M113277X"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/28395.28429"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634090"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488724"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2011.85"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/110845914"},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016. ACM, 842--850","author":"Kyng Rasmus","year":"1892","unstructured":"Rasmus Kyng, Yin Tat Lee, Richard Peng, Sushant Sachdeva, and Daniel A. Spielman. 2016. Sparsified Cholesky and multigrid solvers for connection laplacians. In Proc. of the 48th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2016. ACM, 842--850. arXiv:1512.01892"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.68"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2484239.2501983"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384268"},{"key":"e_1_3_2_1_28_1","volume-title":"Liu and Aaron Sidford","author":"Yang","year":"2020","unstructured":"Yang P. Liu and Aaron Sidford. 2020. Faster Divergence Maximization for Faster Maximum Flow. CoRR abs\/2003.08929 (2020). arXiv:2003.08929 https:\/\/arxiv.org\/abs\/2003.08929"},{"key":"e_1_3_2_1_29_1","volume-title":"Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 803--814","author":"Yang","year":"1910","unstructured":"Yang P. Liu and Aaron Sidford. 2020. Faster energy maximization for faster maximum flow. In Proc. of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2020. ACM, 803--814. arXiv:1910.14276"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539704441848"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch130"},{"key":"e_1_3_2_1_34_1","volume-title":"Proc. of the Symposium on Theory of Computing, STOC","author":"Peng Richard","year":"2014","unstructured":"Richard Peng and Daniel A. Spielman. 2014. An efficient parallel solver for SDD linear systems. In Proc. of the Symposium on Theory of Computing, STOC 2014. ACM, 333--342. arXiv:1311.3286"},{"key":"e_1_3_2_1_35_1","volume-title":"Proc. of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022. ACM, 478--487","author":"Rozhon V\u00e1clav","year":"2022","unstructured":"V\u00e1clav Rozhon, Christoph Grunau, Bernhard Haeupler, Goran Zuzic, and Jason Li. 2022. Undirected (1+\u03f5)-shortest paths via minor-aggregates: near-optimal deterministic parallel and distributed algorithms. In Proc. of the 54th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2022. ACM, 478--487. arXiv:2204.05874"},{"key":"e_1_3_2_1_36_1","volume-title":"Nearly Maximum Flows in Nearly Linear Time. In Porc. of the 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013. IEEE Computer Society, 263--269","author":"Sherman Jonah","year":"2013","unstructured":"Jonah Sherman. 2013. Nearly Maximum Flows in Nearly Linear Time. In Porc. of the 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013. IEEE Computer Society, 263--269. arXiv:1304.2077"},{"key":"e_1_3_2_1_37_1","volume-title":"Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC","author":"Daniel","year":"2004","unstructured":"Daniel A. Spielman and Shang-Hua Teng. 2004. Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC 2004). ACM, 81--90. arXiv:cs\/0310051"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00090"}],"event":{"name":"PODC '23: 2023 ACM Symposium on Principles of Distributed Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Orlando FL USA","acronym":"PODC '23"},"container-title":["Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594577","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583668.3594577","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:55Z","timestamp":1750178275000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583668.3594577"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,16]]},"references-count":38,"alternative-id":["10.1145\/3583668.3594577","10.1145\/3583668"],"URL":"https:\/\/doi.org\/10.1145\/3583668.3594577","relation":{},"subject":[],"published":{"date-parts":[[2023,6,16]]},"assertion":[{"value":"2023-06-16","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}