Author:
Das Sourav,Fernando Rex,Komargodski Ilan,Shi Elaine,Soni Pratik
Publisher
Springer Nature Switzerland
Reference59 articles.
1. Kook Jin Ahn and Sudipto Guha: Access to data and number of iterations: dual primal algorithms for maximum matching under resource constraints. ACM Trans. Parallel Comput. (TOPC) 4(4), 17 (2018)
2. Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: STOC 2014 (2014)
3. Andoni, A., Stein, C., Zhong, P.: Log diameter rounds algorithms for $$2 $$-vertex and $$2 $$-edge connectivity. arXiv preprint arXiv:1905.00850 (2019)
4. Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and hardness of approximation problems. In: 33rd Annual Symposium on Foundations of Computer Science, FOCS, pp. 14–23 (1992)
5. Arun, A., Ganesh, C., Lokam, S.V., Mopuri, T., Sridhar, S.: Dew: a transparent constant-sized polynomial commitment scheme. In: Public Key Cryptography, pp. 542–571 (2023)