American Psychological Association 6th edition

Blanchard, M., Zhang, J., & Jaillet, P. (2025). Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal. Mathematics of Operations Research, 50(4), 2941-2971. https://doi.org/10.1287/moor.2023.0208

ISO-690 (author-date, English)

BLANCHARD, Moïse, ZHANG, Junhui und JAILLET, Patrick, 2025. Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal. Mathematics of Operations Research. 1 November 2025. Vol. 50, no. 4, p. 2941-2971. DOI 10.1287/moor.2023.0208.

Modern Language Association 9th edition

Blanchard, M., J. Zhang, und P. Jaillet. „Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.“. Mathematics of Operations Research, Bd. 50, Nr. 4, November 2025, S. 2941-7, https://doi.org/10.1287/moor.2023.0208.

Mohr Siebeck - Recht (Deutsch - Österreich)

Blanchard, Moïse/Zhang, Junhui/Jaillet, Patrick: Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal., Mathematics of Operations Research 2025, 2941-2971.

Emerald - Harvard

Blanchard, M., Zhang, J. und Jaillet, P. (2025), „Quadratic Memory Is Necessary for Optimal Query Complexity in Convex Optimization: Center of Mass Is Pareto Optimal.“, Mathematics of Operations Research, Vol. 50 No. 4, S. 2941-2971.

Achtung: Diese Zitate sind unter Umständen nicht zu 100% korrekt.