APA (7th ed.) Citation

Chowdhury, R. A., Kaykobad, M., & Nath, S. K. (2000). A simplified complexity analysis of mcdiarmid and reed's variant of bottom-up-heapsort. International journal of computer mathematics, 73(3), 293-297. https://doi.org/10.1080/00207160008804896

Chicago Style (17th ed.) Citation

Chowdhury, Rezaul Alam, M. Kaykobad, and Suman Kumar Nath. "A Simplified Complexity Analysis of Mcdiarmid and Reed's Variant of Bottom-up-heapsort." International Journal of Computer Mathematics 73, no. 3 (2000): 293-297. https://doi.org/10.1080/00207160008804896.

MLA (9th ed.) Citation

Chowdhury, Rezaul Alam, et al. "A Simplified Complexity Analysis of Mcdiarmid and Reed's Variant of Bottom-up-heapsort." International Journal of Computer Mathematics, vol. 73, no. 3, 2000, pp. 293-297, https://doi.org/10.1080/00207160008804896.