Cita APA (7a ed.)

Chen, T., Ray, A., Seshadri, A., Herman, D., Bach, B., Deshpande, P., . . . Pistoia, M. (2025). Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling.

Cita Chicago Style (17a ed.)

Chen, Tyler, Archan Ray, Akshay Seshadri, Dylan Herman, Bao Bach, Pranav Deshpande, Abhishek Som, Niraj Kumar, y Marco Pistoia. Provably Faster Randomized and Quantum Algorithms for $k$-means Clustering via Uniform Sampling. 2025.

Cita MLA (9a ed.)

Chen, Tyler, et al. Provably Faster Randomized and Quantum Algorithms for $k$-means Clustering via Uniform Sampling. 2025.

Precaución: Estas citas no son 100% exactas.