American Psychological Association 6th edition

Chattopadhyay, A., Dahiya, Y., & Mahajan, M. (2025). Pseudo-Deterministic Query Complexity of Search Problems. Computational Complexity, 34(2). https://doi.org/10.1007/s00037-025-00266-7

ISO-690 (author-date, English)

CHATTOPADHYAY, Arkadev, DAHIYA, Yogesh and MAHAJAN, Meena, 2025. Pseudo-Deterministic Query Complexity of Search Problems. computational complexity. 1 December 2025. Vol. 34, no. 2, . DOI 10.1007/s00037-025-00266-7.

Modern Language Association 9th edition

Chattopadhyay, A., Y. Dahiya, and M. Mahajan. “Pseudo-Deterministic Query Complexity of Search Problems”. Computational Complexity, vol. 34, no. 2, Dec. 2025, https://doi.org/10.1007/s00037-025-00266-7.

Mohr Siebeck - Recht (Deutsch - Österreich)

Chattopadhyay, Arkadev/Dahiya, Yogesh/Mahajan, Meena: Pseudo-Deterministic Query Complexity of Search Problems, computational complexity 2025,

Emerald - Harvard

Chattopadhyay, A., Dahiya, Y. and Mahajan, M. (2025), “Pseudo-Deterministic Query Complexity of Search Problems”, Computational Complexity, Vol. 34 No. 2, available at:https://doi.org/10.1007/s00037-025-00266-7.

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