Publisher
Springer Nature Switzerland
Reference16 articles.
1. Aho, A., Hopcroft, J., Ullman, J.: The Design and Analysis of Computer Algorithms. Addison-Wesley Publishing Company, Reading (1974)
2. Andoni, A., Indyk, P., Razenshteyn, I.: Approximate nearest neighbor search in high dimensions. CoRR, abs/1806.09823 (2018)
3. Augustine, J., Kothapalli, K., Pandurangan, G.: Efficient distributed algorithms in the k-machine model via pram simulations. In: Proceedings of the IEEE International Parallel and Distributed Processing Symposium (IPDPS), pp. 223–232. IEEE (2021)
4. Lecture Notes in Computer Science;A Björklund,2001
5. Censor-Hillel, K., Kaski, P., Korhonen, J.H., Lenzen, C., Paz, A., Suomela, J.: Algebraic methods in the congested clique. Distrib. Comput. 32(6), 461–478 (2019)