American Psychological Association 6th edition

Baveja, A., Chavan, A., Nikiforov, A., Srinivasan, A., & Xu, P. (2025). Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization. Operations Research, 73(2), 986-994. https://doi.org/10.1287/opre.2018.0340

ISO-690 (author-date, English)

BAVEJA, Alok, CHAVAN, Amit, NIKIFOROV, Andrei, SRINIVASAN, Aravind and XU, Pan, 2025. Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization. Operations Research. 1 March 2025. Vol. 73, no. 2, p. 986-994. DOI 10.1287/opre.2018.0340.

Modern Language Association 9th edition

Baveja, A., A. Chavan, A. Nikiforov, A. Srinivasan, and P. Xu. “Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization.”. Operations Research, vol. 73, no. 2, Mar. 2025, pp. 986-94, https://doi.org/10.1287/opre.2018.0340.

Mohr Siebeck - Recht (Deutsch - Österreich)

Baveja, Alok/Chavan, Amit/Nikiforov, Andrei/Srinivasan, Aravind/Xu, Pan: Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization., Operations Research 2025, 986-994.

Emerald - Harvard

Baveja, A., Chavan, A., Nikiforov, A., Srinivasan, A. and Xu, P. (2025), “Technical Note—Improved Sample-Complexity Bounds in Stochastic Optimization.”, Operations Research, Vol. 73 No. 2, pp. 986-994.

Warning: These citations may not always be 100% accurate.