1. Agrawal, M., Gurjar, R., Korwar, A., Saxena, N.: Hitting-sets for ROABP and sum of set-multilinear circuits. SIAM J. Comput. 44(3), 669–697 (2015)
2. Anari, N., Vazirani, V.V: Matching is as easy as the decision problem, in the NC model. In: Proceedings of the 11th Innovations in Theoretical Computer Science Conference, ITCS 2020, January 12–14, 2020, Seattle, Washington, USA, volume 151 of LIPIcs, pp. 54:1–54:25. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2020)
3. Blikstad, J.: Sublinear-round parallel matroid intersection. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) 49th International Colloquium on Automata, Languages, and Programming, ICALP 2022, July 4–8, 2022, Paris, France, volume 229 of LIPIcs, pp. 25:1–25:17. Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022)
4. Blikstad, J., van den Brand, J., Mukhopadhyay, S., Nanongkai, D.: Breaking the quadratic barrier for matroid intersection. In: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021, pp. 421–432. Association for Computing Machinery, New York, NY, USA (2021)
5. Chakrabarty, D., Chen, Y., Khanna, S.: 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, pp. 37–48. IEEE (2021)