APA (7th ed.) Citation

Kujala, J., & Elomaa, T. (2008). The cost of offline binary search tree algorithms and the complexity of the request sequence. Theoretical computer science, 393(1), 231-239. https://doi.org/10.1016/j.tcs.2007.12.015

Chicago Style (17th ed.) Citation

Kujala, Jussi, and Tapio Elomaa. "The Cost of Offline Binary Search Tree Algorithms and the Complexity of the Request Sequence." Theoretical Computer Science 393, no. 1 (2008): 231-239. https://doi.org/10.1016/j.tcs.2007.12.015.

MLA (9th ed.) Citation

Kujala, Jussi, and Tapio Elomaa. "The Cost of Offline Binary Search Tree Algorithms and the Complexity of the Request Sequence." Theoretical Computer Science, vol. 393, no. 1, 2008, pp. 231-239, https://doi.org/10.1016/j.tcs.2007.12.015.