Nanongkai, Danupon Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Blikstad, J., Brand, J. V. D., Efron, Y., Mukhopadhyay, S., & Nanongkai, D. (2022). Nearly Optimal Communication and Query Complexity of Bipartite Matching. In FOCS 2022 (pp. 1174-1185). Piscataway, NJ: IEEE. doi:10.1109/FOCS54457.2022.00113.