APA (7th ed.) Citation

Azar, Y., & Vishkin, U. (1987). Tight comparison bounds on the complexity of parallel sorting. SIAM Journal on Computing, 16, 458. https://doi.org/10.1137/0216032

Chicago Style (17th ed.) Citation

Azar, Yossi, and Uzi Vishkin. "Tight Comparison Bounds on the Complexity of Parallel Sorting." SIAM Journal on Computing 16 (1987): 458. https://doi.org/10.1137/0216032.

MLA (9th ed.) Citation

Azar, Yossi, and Uzi Vishkin. "Tight Comparison Bounds on the Complexity of Parallel Sorting." SIAM Journal on Computing, vol. 16, 1987, p. 458, https://doi.org/10.1137/0216032.