Skip to content

Author

Adam Karczmarz

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Conference Aug 2026

Strongly Polynomial Parallel Maximum Flow Revisited

This work shows that a randomized parallel implementation of a variant of the strongly polynomial max-flow algorithm of Dadush, Orlin, Sidford, and V\'egh [SODA 2026] runs in $\tilde{O}(mn)$ work and $\tilde{O}(m)$ depth, which improves upon the previously described tradeoffs between work and depth.

Adam Karczmarz, P. Pilarski · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.