A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Deeparnab Chakrabarty, Yu Chen, Sanjeev Khanna. A Polynomial Lower Bound on the Number of Rounds for Parallel Submodular Function Minimization. In 62nd IEEE Annual Symposium on Foundations of Computer Science, FOCS 2021, Denver, CO, USA, February 7-10, 2022. pages 37-48, IEEE, 2021. [doi]

This author has not been identified. Look up 'Deeparnab Chakrabarty' in GoogleThis author has not been identified. Look up 'Yu Chen' in GoogleThis author has not been identified. Look up 'Sanjeev Khanna' in Google

runs on WebDSL