Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Arpit Agarwal, Sanjeev Khanna, Huan Li 0002, Prathamesh Patil, Chen Wang, Nathan White, Peilin Zhong. Parallel Approximate Maximum Flows in Near-Linear Work and Polylogarithmic Depth. In David P. Woodruff, editor, Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, SODA 2024, Alexandria, VA, USA, January 7-10, 2024. pages 3997-4061, SIAM, 2024. [doi]

This author has not been identified. Look up 'Arpit Agarwal' in GoogleThis author has not been identified. Look up 'Sanjeev Khanna' in GoogleThis author has not been identified. Look up 'Huan Li 0002' in GoogleThis author has not been identified. Look up 'Prathamesh Patil' in GoogleThis author has not been identified. Look up 'Chen Wang' in GoogleThis author has not been identified. Look up 'Nathan White' in GoogleThis author has not been identified. Look up 'Peilin Zhong' in Google

runs on WebDSL