{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T23:39:53Z","timestamp":1771457993299,"version":"3.50.1"},"reference-count":42,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"6","funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1718695"],"award-info":[{"award-number":["CCF 1718695"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1844855"],"award-info":[{"award-number":["CCF-1844855"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000005","name":"U.S. Department of Defense","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1137\/20m1383525","type":"journal-article","created":{"date-parts":[[2022,4,18]],"date-time":"2022-04-18T13:21:29Z","timestamp":1650288089000},"page":"FOCS20-175-FOCS20-204","source":"Crossref","is-referenced-by-count":5,"title":["Unit Capacity Maxflow in Almost $m^{4\/3}$ Time"],"prefix":"10.1137","volume":"53","author":[{"given":"Tarun","family":"Kathuria","sequence":"first","affiliation":[]},{"given":"Yang P.","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Aaron","family":"Sidford","sequence":"additional","affiliation":[]}],"member":"351","published-online":{"date-parts":[[2022,4,18]]},"reference":[{"key":"atypb1","first-page":"1424","volume-title":"Proceedings of the 2019 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2019","author":"Adil D.","year":"2019"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.54"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00018"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1145\/3188745.3188776"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1145\/2422436.2422469"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1145\/1993636.1993674"},{"key":"atypb7","volume-title":"A Deterministic Algorithm for Balanced Cut with Applications to Dynamic Connectivity, Flows, and Beyond, preprint, https:\/\/arxiv.org\/abs\/1910.08025","author":"Chuzhoy J.","year":"2019"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792236717"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316303"},{"key":"atypb10","first-page":"771","volume-title":"Proceedings of the 2017 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017","author":"Cohen M. B.","year":"2017"},{"key":"atypb11","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374441"},{"key":"atypb12","doi-asserted-by":"publisher","DOI":"10.1137\/0204043"},{"key":"atypb13","volume-title":"Fully Dynamic Electrical Flows: Sparse Maxflow Faster than Goldberg-Rao, preprint, https:\/\/arxiv.org\/abs\/2101.07233","author":"Gao Y.","year":"2021"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1145\/290179.290181"},{"key":"atypb15","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258596"},{"key":"atypb16","first-page":"499","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998","author":"Karger D. R.","year":"1998"},{"key":"atypb17","doi-asserted-by":"publisher","DOI":"10.1287\/moor.24.2.383"},{"key":"atypb18","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276714"},{"key":"atypb19","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.16"},{"key":"atypb20","doi-asserted-by":"publisher","DOI":"10.1145\/2213977.2213979"},{"key":"atypb21","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316410"},{"key":"atypb22","volume-title":"Flows in Almost Linear Time via Adaptive Preconditioning, preprint, https:\/\/arxiv.org\/abs\/1906.10340","author":"Kyng R.","year":"2019"},{"key":"atypb23","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488704"},{"key":"atypb24","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.52"},{"key":"atypb25","first-page":"2157","volume-title":"Proceedings of the Conference on Learning Theory, COLT 2019, Phoenix, AZ, A. Beygelzimer and D. Hsu, eds., Proceedings of Machine Learning Research 99","author":"Lee Y. T.","year":"2019"},{"key":"atypb26","volume-title":"Reducing Directed Max Flow to Undirected Max Flow, unpublished manuscript","author":"Lin H.","year":"2009"},{"key":"atypb27","volume-title":"Faster Divergence Maximization for Faster Maximum Flow, preprint, https:\/\/arxiv.org\/abs\/2003.08929","author":"Liu Y. P.","year":"2020"},{"key":"atypb28","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384247"},{"key":"atypb29","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.35"},{"key":"atypb30","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2016.70"},{"key":"atypb31","volume-title":"Introductory Lectures on Convex Programming Volume I: Basic Course, lecture notes","author":"Nesterov Y.","year":"1998"},{"key":"atypb32","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970791"},{"key":"atypb33","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"atypb34","first-page":"1867","volume-title":"Proceedings of the 2016 Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016","author":"Peng R.","year":"2016"},{"key":"atypb35","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580724"},{"key":"atypb36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.36"},{"key":"atypb37","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055501"},{"key":"atypb38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2018.00091"},{"key":"atypb39","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007372"},{"key":"atypb40","first-page":"869","volume-title":"Proceedings of the ACM Symposium on Theory of Computing, STOC 2021","author":"van den Brand J.","year":"2021"},{"key":"atypb41","volume-title":"Bipartite Matching in Nearly-Linear Time on Moderately Dense Graphs, preprint, https:\/\/arxiv.org\/abs\/2009.01802v2","author":"van den Brand J.","year":"2020"},{"key":"atypb42","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384309"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","deposited":{"date-parts":[[2024,12,16]],"date-time":"2024-12-16T15:33:44Z","timestamp":1734363224000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/20M1383525"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,18]]},"references-count":42,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["10.1137\/20M1383525"],"URL":"https:\/\/doi.org\/10.1137\/20m1383525","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,4,18]]}}}