Author:
Hanguir Oussama,Stein Clifford
Publisher
Springer International Publishing
Reference52 articles.
1. Abbar, S., Amer-Yahia, S., Indyk, P., Mahabadi, S., Varadarajan, K.R.: Diverse near neighbor problem. In: Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry, pp. 207–214. ACM (2013)
2. Ahn, K.J., Guha, S.: 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)
3. Alon, N., Babai, L., Itai, A.: A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algor. 7(4), 567–583 (1986)
4. Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the Forty-Sixth Annual ACM Symposium on Theory of Computing, pp. 574–583. ACM (2014)
5. Andoni, A., Song, Z., Stein, C., Wang, Z., Zhong, P.: Parallel graph connectivity in log diameter rounds. In: 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), pp. 674–685. IEEE (2018)